Hub Location Problems in Urban Traffic Networks

  • Stefan Nickel
  • Anita Schöbel
  • Tim Sonneborn
Part of the Applied Optimization book series (APOP, volume 48)


In this paper we present new hub location models which are applicable for urban public transportation networks. In order to obtain such models we relax some of the general assumptions that are usually satisfied in hub location problems, but which are not useful for public transportation networks. For instance we do not require that the hub nodes have to be completely interconnected. These new models are based on network design formulations, in which the constraint that all flow has to be routed via some hub nodes is formulated by a flow conservation law. We present some solution approaches for these new models and illustrate the results on a numerical example.


hub location urban public transportation network design 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: theory, algorithms and applications. Prentice Hall, Engelwood Cliffs, New Jersey.Google Scholar
  2. [2]
    Balakrishnan, A., Magnanti, T. L., and Wong, R. (1989). A dual ascent procedure for large-scale uncapacitated network design. Operations Research, 37 (5): 716–740.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72: 387–405.CrossRefzbMATHGoogle Scholar
  4. [4]
    DASH (1999). XPRESS-MP. Internet:
  5. [5]
    Ebery, J., Krishnamoorthy, M., Ernst, A., and Boland, N. (1998). The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, forthcoming.Google Scholar
  6. [6]
    Ernst, A. T. and Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4 (3): 139–154.CrossRefzbMATHGoogle Scholar
  7. [7]
    Ernst, A. T. and Krishnamoorthy, M. (1998a). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104. 1: 100–112.Google Scholar
  8. [8]
    Ernst, A. T. and Krishnamoorthy, M. (1998b). Shortest-path based lower bounding methods for p-hub median problems. INFORMS Journal on Computing, 10 (2): 149–162.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    Fasbender, G. (1999). Problème de localisation de hubs sans capacité. Master’s thesis, Université Libre de Bruxelles, Faculté de Sciences. (in French).Google Scholar
  10. [10]
    Fourer, R., Gay, D. M., and Kerningham, B. W. (1993). AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, San Francisco.Google Scholar
  11. [11]
    Labbé, M. (1998). Private communication.Google Scholar
  12. [12]
    Magnanti, T. L. and Wong, R. T. (1984). Network design and transportation planning: Models and algorithms Transportation Science, 18: 1–55.Google Scholar
  13. [13]
    O’Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32: 393–404.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [14]
    Skorin-Kapov, D., Skorin-Kapov, J., and O’Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94: 582–593.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Stefan Nickel
  • Anita Schöbel
  • Tim Sonneborn
    • 1
  1. 1.Institut für Techno- und Wirtschaftsmathematik (ITWM) e.V.KaiserslauternGermany

Personalised recommendations