Abstract
This paper presents an urban rapid transit network design model, which consists of the location of train alignments and stations in an urban traffic context. The design attempts to maximize the public transportation demand using the new infrastructure, considering a limited budget and number of transit lines. The location problem also incorporates the fact that users can choose their transportation mode and trips. In real cases, this problem is complex to solve because it has thousands of binary variables and constraints, and cannot be solved efficiently by Branch and Bound. For this reason, some algorithms based on Benders decomposition have been defined in order to solve it. These algorithms have been compared in test networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruno, G., Ghiani, G., & Improta, G. (1998). A multi-modal approach to the location of a rapid transit line. European Journal of Operational Research, 104, 321–332.
Bruno, G., Gendreau, M., & Laporte, G. (2002). A heuristic for the location of a rapid transit line. Computers and Operations Research, 29, 1–12.
Dufourd, H., Gendreau, M., & Laporte, G. (1996). Locating a transit line using tabu search. Location Science, 4, 1–19.
García, R., & Marín, A. (2001). Urban multimodal interchange design methodology. In M. Pursula & J. Niittymäki (Eds.), Mathematical methods on optimization in transportation systems (pp. 49–75). Dordrecht: Kluwer.
García, R., & Marín, A. (2002). Parking capacity and pricing in park’n ride trips: A continuous equilibrium network design problem. Annals of Operations Research, 116, 153–178.
Gutiérrez, G. J., Kouvelis, P., & Kurawarwala, A. A. (1996). A robustness approach to uncapacitated network design problems. European Journal of Operation Research, 94, 362–376.
Hamacher, H., Liebers, A., Schöbel, A., Wagner, D., & Wagner, F. (2001). Locating new stops in a railway network. In Electronic notes in theoretical computer science: Vol. 50.
Kalvelagen, E. (2005). Benders decomposition with Gams. http://www.gams.com/~erwin/benders/benders.pdf. Accessed December 2007.
Labbe, M., & Rodríguez-Martín, L. G. (1998). Path tree and cycle location. In T. Cranic & G. Laporte (Eds.), Fleet management and logistics (pp. 187–204). Dordrecht: Kluwer Academic.
Laporte, G., Mesa, J. A., & Ortega, F. A. (2002). Locating stations on rapid transit lines. Computers & Operations Research, 29, 741–759.
Laporte, G., Marín, A., Mesa, J. A., & Ortega, F. A. (2007). An integrated methodology for the rapid transit network design problem. In F. Garaets, L. Kroon, A. Schoebel, D. Wagner, & Ch. Zaroliagis (Eds.), Lecture Notes in Computer Science : Vol. 4359. Algorithmic Methods for Railway Optimization. Berlin: Springer.
Laporte, G., Mesa, J. A., Ortega, F. A., & Sevillano, I. (2005). Maximizing trip coverage in location of a single rapid transit alignment. Annals of Operations Research, 136, 49–63.
Marín, A. (2007). Urban rapid transit network design. TOP, 15, 231–241.
Mercier, A., Cordeau, J. F., & Soumis, F. (2005). A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research, 32, 1451–1476.
Mesa, J. A., & Boffey, T. B. (1996). A review of extensive facility location in networks. European Journal of Operational Research, 95, 592–603.
Author information
Authors and Affiliations
Corresponding author
Additional information
The project has been supported by the research project 70029/T05, from the Spanish “Ministerio de Fomento” and the research project TRA2005-09068-C03-01, from the Spanish “Ministerio de Educación y Ciencia”.
Rights and permissions
About this article
Cite this article
Marín, Á.G., Jaramillo, P. Urban rapid transit network design: accelerated Benders decomposition. Ann Oper Res 169, 35–53 (2009). https://doi.org/10.1007/s10479-008-0388-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0388-0