Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T15:59:47.438Z Has data issue: false hasContentIssue false
  • English
  • Français

On designing connected rapid transit networks reducing thenumber of transfers

Published online by Cambridge University Press:  19 January 2012

Laureano Fernando Escudero  and
Susana Muñoz
Laureano Fernando Escudero
Affiliation:
Departamento de Estadística e Investigación Operativa, Universidad Rey Juan Carlos, 28933 Móstoles (Madrid), Spain. laureano.escudero@urjc.es
Susana Muñoz
Affiliation:
Corresponding author. Departamento de Estadística e Investigación Operativa, Facultad de Ciencias Matemáticas, Universidad Complutense de Madrid, 28040 Madrid, Spain; smunoz@estad.ucm.es
Get access

Abstract

In this paper we introduce some improvements on an approach that we described elsewherefor solving a modification of the well-known extended rapid transit network designproblem. Firstly, we propose an integer programming model for selecting the stations to beconstructed and the links between them, in such a way that a connected rapid transitnetwork is obtained. Secondly, we consider a linear 0-1 programming model for determininga route of minimum length in the rapid transit network between certain pairs of locations,and present a greedy heuristic procedure which attempts to minimize an estimation of thetotal number of transfers that should be made by the users to arrive at theirdestinations. We also report several computational experiments that show that thisprocedure can significantly reduce the estimated total number of transfers required forthe solutions obtained using our previous approach.

Keywords

Station and link locationline designingdegree of a nodetransfergreedy heuristic procedure
Type
Research Article
Information
RAIRO - Operations Research , Volume 45 , Issue 4 , October 2011 , pp. 315 - 338
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Baaj, M.H. and Mahmassani, H.S., An AI-based approach for transit route system planning and design. J. Adv. Transp. 25 (1991) 187–209. Google Scholar
Bussieck, M.R., Kreuzer, P. and Zimmermann, U.T., Optimal lines for railway systems. Eur. J. Oper. Res. 96 (1997) 54–63. Google Scholar
Bussieck, M.R., Winter, T. and Zimmermann, U.T., Discrete optimization in public rail transport. Math. Program. 79 (1997) 415–444. Google Scholar
Cepeda, M., Cominetti, R. and Florian, M., A frequency-based assignment model for congested transit networks with strict capacity constraints : characterization and computation of equilibria. Transp. Res. Part B 40 (2006) 437–459. Google Scholar
Escudero, L.F. and Muñoz, S., An approach for solving a modification of the extended rapid transit network design problem. Top 17 (2009) 320–334. Google Scholar
L.F. Escudero and S. Muñoz, An approach for designing connected rapid transit networks considering transfers. Technical Reports on Statistics and Decision Sciences TR09/01, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain (2009).
R. García, A. Garzón-Astolfi, Á. Marín, J.A. Mesa and F.A. Ortega, Analysis of the parameters of transfers in rapid transit network design, in 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, edited by L.G. Kroon and R.H. Möhring, Oasics 2. Saarbrücken (2006).
Guan, J.F., Yang, H. and Wirasinghe, S.C., Simultaneous optimization of transit line configuration and passenger line assignment. Transp. Res. Part B 40 (2006) 885-902. Google Scholar
Guihaire, V. and Hao, J.K., Transit network design and scheduling : A global review. Transp. Res. Part A 42 (2008) 1251–1273. Google Scholar
Laporte, G., Marín, Á., Mesa, J.A. and Perea, F., Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45 (2011) 54–65. Google Scholar
Laporte, G., Mesa, J.A., Ortega, F.A. and Perea, F., Planning rapid transit networks. Socio-Econ. Plan. Sci. 45 (2011) 95–104. Google Scholar
Laporte, G., Mesa, J.A., Ortega, F.A. and Sevillano, I., Maximizing trip coverage in the location of a single rapid transit alignment. Ann. Oper. Res. 136 (2005) 49–63. Google Scholar
Mandl, C.E., Evaluation and optimization of urban public transportation networks. Eur. J. Oper. Res. 5 (1980) 396–404. Google Scholar
Marín, Á., An extension to rapid transit network design problem. Top 15 (2007) 231–241. Google Scholar
Marín, Á. and García-Ródenas, R., Location of infrastructure in urban railway networks. Comput. Oper. Res. 36 (2009) 1461–1477. Google Scholar
Spiess, H. and Florian, M., Optimal strategies : A new assignment model for transit networks. Transp. Res. Part B 23 (1989) 83–102. Google Scholar
Wardrop, J.G., Some theoretical aspects of road traffic research. ICE Proceeding Engineering Divisions 1 (1952) 325–362. Google Scholar