Hub Location Problems in Urban Traffic Networks
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.
Keywordshub location urban public transportation network design
Unable to display preview. Download preview PDF.
- 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
- 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.Google Scholar
- 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
- 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
- Fourer, R., Gay, D. M., and Kerningham, B. W. (1993). AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, San Francisco.Google Scholar
- Labbé, M. (1998). Private communication.Google Scholar
- Magnanti, T. L. and Wong, R. T. (1984). Network design and transportation planning: Models and algorithms Transportation Science, 18: 1–55.Google Scholar