On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero; Susana Muñoz

RAIRO - Operations Research - Recherche Opérationnelle (2011)

  • Volume: 45, Issue: 4, page 315-338
  • ISSN: 0399-0559

Abstract

top
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a 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 the total number of transfers that should be made by the users to arrive at their destinations. We also report several computational experiments that show that this procedure can significantly reduce the estimated total number of transfers required for the solutions obtained using our previous approach.

How to cite

top

Escudero, Laureano Fernando, and Muñoz, Susana. "On designing connected rapid transit networks reducing the number of transfers." RAIRO - Operations Research - Recherche Opérationnelle 45.4 (2011): 315-338. <http://eudml.org/doc/275076>.

@article{Escudero2011,
abstract = {In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a 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 the total number of transfers that should be made by the users to arrive at their destinations. We also report several computational experiments that show that this procedure can significantly reduce the estimated total number of transfers required for the solutions obtained using our previous approach.},
author = {Escudero, Laureano Fernando, Muñoz, Susana},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {station and link location; line designing; degree of a node; transfer; greedy heuristic procedure},
language = {eng},
number = {4},
pages = {315-338},
publisher = {EDP-Sciences},
title = {On designing connected rapid transit networks reducing the number of transfers},
url = {http://eudml.org/doc/275076},
volume = {45},
year = {2011},
}

TY - JOUR
AU - Escudero, Laureano Fernando
AU - Muñoz, Susana
TI - On designing connected rapid transit networks reducing the number of transfers
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2011
PB - EDP-Sciences
VL - 45
IS - 4
SP - 315
EP - 338
AB - In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a 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 the total number of transfers that should be made by the users to arrive at their destinations. We also report several computational experiments that show that this procedure can significantly reduce the estimated total number of transfers required for the solutions obtained using our previous approach.
LA - eng
KW - station and link location; line designing; degree of a node; transfer; greedy heuristic procedure
UR - http://eudml.org/doc/275076
ER -

References

top
  1. [1] M.H. Baaj and H.S. Mahmassani, An AI-based approach for transit route system planning and design. J. Adv. Transp.25 (1991) 187–209. 
  2. [2] M.R. Bussieck, P. Kreuzer and U.T. Zimmermann, Optimal lines for railway systems. Eur. J. Oper. Res.96 (1997) 54–63. Zbl0926.90005
  3. [3] M.R. Bussieck, T. Winter and U.T. Zimmermann, Discrete optimization in public rail transport. Math. Program.79 (1997) 415–444. Zbl0887.90055MR1464777
  4. [4] M. Cepeda, R. Cominetti and M. Florian, A frequency-based assignment model for congested transit networks with strict capacity constraints : characterization and computation of equilibria. Transp. Res. Part B40 (2006) 437–459. 
  5. [5] L.F. Escudero and S. Muñoz, An approach for solving a modification of the extended rapid transit network design problem. Top17 (2009) 320–334. Zbl1179.90034MR2576426
  6. [6] 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). 
  7. [7] 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). Zbl1247.90045
  8. [8] J.F. Guan, H. Yang and S.C. Wirasinghe, Simultaneous optimization of transit line configuration and passenger line assignment. Transp. Res. Part B40 (2006) 885-902. 
  9. [9] V. Guihaire and J.K. Hao, Transit network design and scheduling : A global review. Transp. Res. Part A42 (2008) 1251–1273. 
  10. [10] G. Laporte, Á. Marín, J.A. Mesa and F. Perea, Designing robust rapid transit networks with alternative routes. J. Adv. Transp.45 (2011) 54–65. 
  11. [11] G. Laporte, J.A. Mesa, F.A. Ortega and F. Perea, Planning rapid transit networks. Socio-Econ. Plan. Sci. 45 (2011) 95–104. Zbl0887.90061
  12. [12] G. Laporte, J.A. Mesa, F.A. Ortega and I. Sevillano, Maximizing trip coverage in the location of a single rapid transit alignment. Ann. Oper. Res.136 (2005) 49–63. Zbl1114.90062MR2147042
  13. [13] C.E. Mandl, Evaluation and optimization of urban public transportation networks. Eur. J. Oper. Res.5 (1980) 396–404. Zbl0441.90030MR592511
  14. [14] Á. Marín, An extension to rapid transit network design problem. Top15 (2007) 231–241. Zbl1145.90009MR2361315
  15. [15] Á. Marín and R. García-Ródenas, Location of infrastructure in urban railway networks. Comput. Oper. Res.36 (2009) 1461–1477. Zbl1179.90209
  16. [16] H. Spiess and M. Florian, Optimal strategies : A new assignment model for transit networks. Transp. Res. Part B23 (1989) 83–102. 
  17. [17] J.G. Wardrop, Some theoretical aspects of road traffic research. ICE Proceeding Engineering Divisions1 (1952) 325–362. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.