Planning rapid transit networks

Socio-Economic Planning Sciences

Volumn 45, Issue 3, 2011, Pages 95-104

  Laporte, G ^a   Mesa, J A ^b   Ortega, F A ^c   Perea, F ^d  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSIDAD DE SEVILLA   (Spain)

^c UNIVERSITY OF SEVILLE   (Spain)

^d UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Heuristics; Mathematical programming; Planning; Rapid transit network design

Indexed keywords

HEURISTICS; MULTIOBJECTIVE PROGRAMMING; NETWORK DESIGN; NUMERICAL MODEL; OPTIMIZATION; PLANNING METHOD; RAILWAY TRANSPORT; TRANSPORTATION PLANNING;

EID: 79957537933     PISSN: 00380121     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.seps.2011.02.001     Document Type: Article

References (58)

1. Rodrigue J.P., Comtois C. Transport and sustainability. The geography of transport systems 2009, 274-279. Routledge, New York. J.P. Rodrigue, C. Comtois, B. Slack (Eds.).
2. List of metro systems, [accessed 07.02.11.]. http://en.wikipedia.org/wiki/List_of_metro_systems.
3. Gendreau M., Laporte G., Mesa J.A. Locating rapid transit lines. Journal of Advanced Transportation 1995, 29:145-162.
4. International Association of Public Transport, [accessed 07.02.11.]. http://www.uitp.org/Public-Transport/metro/index.cfm.
5. World Metro Database, [accessed 07.02.11.]. http://mic-ro.com/metro/table.html.
6. Vuchic V.R. Urban transit operations, planning and economics 2005, Wiley, Hoboken.
7. Laporte G., Mesa J.A., Ortega F.A. Optimization methods for the planning of rapid transit systems. European Journal of Operational Research 2000, 122:1-10.
8. Blackledge DA, Humphreys EMH. The West Midland rapid transit study. In: Proceedings of the Planning and Transport Research and Computation Ltd., Sussex. 1984:p. 71-84.
9. Fukuyama M. Optimal station location for a two hierarchy transit system. In: Proceedings of the Eight International symposium on transport and traffic. 1981:p. 264-291.
10. Mesa J.A., Ortega F.A. Park-and-ride station catchment areas in metropolitan rapid transit systems. Mathematical methods on optimization in transportation systems 2001, 81-93. Kluwer, Dordrecht. M. Pursula, J. Niittmäki (Eds.).
11. Musso A., Vuchic V.R. Characteristics of metro networks and methodology for their evaluation. Transportation Research Record 1988, 1162:22-33.
12. Laporte G., Mesa J.A., Ortega F.A. Assessing the efficiency of rapid transit networks. Studies in Locational Analysis 1994, 7:105-121.
13. Laporte G., Mesa J.A., Ortega F.A. Assessing the efficiency of rapid transit configurations. TOP 1997, 5:95-104.
14. Ovenden M. Transit maps of the world 2007, Penguin Group, London.
15. Derrible S., Kennedy C. Characterizing metro networks: state, form and structure. Transportation 2010, 37:275-297.
16. Minsk Metro, [accessed 07.02.11.]. http://en.wikipedia.org/wiki/Minsk_Metro.
17. Prague Metro, [accessed 07.02.11.]. http://mappery.com/map-of/Prague-Metro-2008-Map.
18. London Underground, [accessed 07.02.11.]. http://www.tfl.gov.uk/assets/downloads/standard-tube-map.pdf.
19. Liebchen C. The first optimized railway timetable in practice. Transportation Science 2008, 42:420-435.
20. Northern Line, London Underground, [accessed 07.02.11.]. http://www.trainweb.org/tubeprune/northern/%20line/%20diagrams.htm.
21. Grötschel M., Monma C.L., Stoer M. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Operations Research 1995, 43:1012-1024.
22. Gattuso D., Miriello E. Compared analysis of metro networks supported by graph theory. Networks and Spatial Economics 2005, 5:395-414.
23. Grubesic T.H., Matisziw T.C., Murray A.T., Snediker D. Comparative approaches for assessing network vulnerability. International Regional Science Review 2008, 31:88-112.
24. Myung Y.S., Kim H.J. A cutting plane algorithm for computing k -edge survivability of a network. European Journal of Operational Research 2004, 156:579-589.
25. Albert R., Barabási A.-L. Statistical mechanics of complex networks. Review of Modern Physics 2002, 74:47-97.
26. Klau G.W., Weiskircher R. Robustness and resilience. Networks analysis, lectures notes in Computer Science 2004, vol. 3418:417-437. Springer, Berlin/Heidelberg. U. Brandes, T. Erlebach (Eds.).
27. Nagurney A., Qiang Q. A network efficiency measure for congested networks. Europhysics Letters 2007, 3:1-5.
28. Nagurney A., Qiang Q. Robustness of transportation networks subject to degradable links. Europhysics Letters 2007, 6:1-14.
29. De-Los-Santos A., Laporte G., Mesa J.A., Perea F. Evaluating passenger robustness doi:10.1016/j.trc.2010.09.002.
30. Boston Subway, [accessed 07.02.11.]. http://www.w3.org/Conferences/WWW4/images/MBTA.gif.
31. Latora V., Machiori M. Is the Boston subway a small-world network?. Physica A 2002, 314:109-113.
32. Criado R., Hernández-Bermejo B., Romance M. Efficiency, vulnerability and cost: an overview with applications to subway networks worldwide. International Journal of Bifurcation and Chaos 2007, 17:2289-2301.
33. Costa A.M., Cordeau J.-F., Laporte G. Steiner tree problems with profits. INFOR 2006, 44:99-115.
34. Klau G.W., Ljubić I., Mutzel P., Pferschy U., Weiskircher R. The fractional prize-collecting Steiner tree problem on trees. Lecture notes in Computer Science 2003, vol. 2832:1304-1315. Springer, Berlin/Heidelberg.
35. Lucena A., Resende M.G.C. Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Applied Mathematics 2004, 141:277-294.
36. Margot F., Prodon A., Liebling T.M. Tree polyhedron on 2-tree. Mathematical Programming 1994, 63:183-192.
37. Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transportation Science 2005, 39:188-205.
38. Mesa J.A., Boffey T.B. A review extensive facility location in networks. European Journal of Operational Research 1996, 95:592-603.
39. Labbé M., Laporte G., Rodríguez-Martín I., Salazar-González J.J. The ring star problem: polyhedral analysis and exact algorithm. Networks 2004, 43:177-189.
40. Labbé M., Laporte G., Rodríguez-Martín I., Salazar-González J.J. Locating median cycles in networks. European Journal of Operational Research 2005, 160:457-470.
41. Laporte G., Mesa J.A., Perea F. A game theoretic framework for the robust railway transit network design problem. Transportation Research Part B 2010, 44:447-459.
42. Escudero L.F., Munoz S. An approach for solving a modification of the extended rapid transit network design problem. TOP 2009, 17:320-324.
43. Marín Á An extension to rapid transit network design problem. TOP 2007, 15. pp. 231-241.
44. Marín Á, García-Ródenas R. Location of infrastructure in urban railway networks. Computers & Operations Research 2009, 36:1461-1477.
45. Schöbel A, Scholl S. Line planning with minimal traveling time. In: ATMOS 2005: 5th workshop on algorithmic methods and models for optimization of railways. 2006:p. 1-16.
46. Borndörfer R., Grötschel M., Pfetsch M.E. Models for line planning in public transport, in: computer-aided scheduling of public transport (CASPT). Lecture Notes in Economics and Mathematical Systems 2008, 600:363-378.
47. Laporte G., Marín Á, Mesa J.A., Perea F. Designing robust rapid transit networks with alternative routes. Journal of Advanced Transportation 2011, 45:54-65.
48. Bruno G., Gendreau M., Laporte G. A heuristic for the location of a rapid transit line. Computers & Operations Research 2002, 29:1-12.
49. Bruno G., Laporte G. An interactive decision support system for the design of rapid public transit networks. INFOR 2002, 40:111-118.
50. Laporte G., Mesa J.A., Ortega F.A., Sevillano I. Maximizing trip coverage in the location of a single rapid transit alignment. Annals of Operations Research 2005, 136:49-63.
51. Michaelis M., Schöbel A. Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic. Public Transportation 2009, 1:211-232.
52. Marín Á, Jaramillo P. Urban transit network design: accelerated benders decomposition. Annals of Operations Research 2009, 169:35-53.
53. Marín Á, Jaramillo P. Urban transit network capacity expansion. European Journal of Operational Research 2008, 191:45-60.
54. Gleason J.M. A set covering approach to bus stop location. Omega 1975, 3:605-608.
55. Poetranto Groß D.R., Hamacher H.W., Horn S., Schöbel A. Stop location design in public transportation networks: covering and accessibility objectives. TOP 2009, 17:335-346.
56. Schöbel A. Locating stops along bus or railway lines - A bicriteria problem. Annals of Operations Research 2008, 136:211-227.
57. Vuchic V.R., Newell G.F. Rapid transit interstation spacing for minimum travel time. Transportation Science 1968, 2:303-339.
58. Laporte G., Mesa J.A., Ortega F.A. Locating stations on rapid transit lines. Computers & Operations Research 2002, 29:741-759.