Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network flows: theory, algorithms and applications. Prentice Hall, Engelwood Cliffs, New Jersey.
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.
Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72: 387–405.
DASH (1999). XPRESS-MP. Internet: http://www.dash.co.uk.
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.
Ernst, A. T. and Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4 (3): 139–154.
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.
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.
Fasbender, G. (1999). Problème de localisation de hubs sans capacité. Master’s thesis, Université Libre de Bruxelles, Faculté de Sciences. (in French).
Fourer, R., Gay, D. M., and Kerningham, B. W. (1993). AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, San Francisco.
Labbé, M. (1998). Private communication.
Magnanti, T. L. and Wong, R. T. (1984). Network design and transportation planning: Models and algorithms Transportation Science, 18: 1–55.
O’Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32: 393–404.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nickel, S., Schöbel, A., Sonneborn, T. (2001). Hub Location Problems in Urban Traffic Networks. In: Pursula, M., Niittymäki, J. (eds) Mathematical Methods on Optimization in Transportation Systems. Applied Optimization, vol 48. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3357-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3357-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4845-8
Online ISBN: 978-1-4757-3357-0
eBook Packages: Springer Book Archive