Chapter 3 Passenger Railway Optimization

Handbooks in Operations Research and Management Science

Volumn 14, Issue C, 2007, Pages 129-187

  Caprara, Alberto ^a   Kroon, Leo ^b,c   Monaci, Michele ^d   Peeters, Marc ^e   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b NS Reizigers   (Netherlands)

^c ERASMUS UNIVERSITY   (Netherlands)

^d UNIVERSITY OF PADOVA   (Italy)

^e Electrabel   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77950601830     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(06)14003-7     Document Type: Review

References (107)

1. Abbink E.W.J., van den Berg B.W.V., Kroon L.G., and Salomon M. Allocation of railway rolling stock for passenger trains. Transportation Science 38 (2004) 33-41
2. Abbink E.W.J., Fischetti M., Kroon L.G., Timmer G., and Vromans M.J.C.M. Reinventing crew scheduling at Netherlands railways. Interfaces 35 (2005) 393-401
3. Arabeyre J., Fearnley J., Steiger F., and Teather W. The airline crew scheduling problem: A survey. Transportation Science 3 (1969) 140-163
4. Balakrishnan N., and Wong R.T. A network model for the rotating workforce scheduling problem. Networks 20 (1990) 25-42
5. Balas E., and Carrera M.C. A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44 (1996) 875-890
6. Balas E., and Ho A. Set covering algorithms using cutting planes, heuristics and subgradient optimization: A computational study. Mathematical Programming Study 12 (1980) 37-60
7. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: Column generation for solving huge integer programs. In: Birge J.R., and Murty K.G. (Eds). Mathematical Programming: State of the Art 1994 (1994), University of Michigan Press, Ann Arbor 186-207
8. Beasley J.E. An algorithm for set covering problems. European Journal of Operational Research 31 (1987) 85-93
9. Beasley J.E. A Lagrangian heuristic for set covering problems. Naval Research Logistics 37 (1990) 151-164
10. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
11. Beasley J.E., and Jörnsten K. Enhancing an algorithm for set covering problems. European Journal of Operational Research 58 (1992) 293-300
12. Ben-Khedher N., Kintanar J., Queille C., and Stripling W. Schedule optimization at SNCF: From conception to day of departure. Interfaces 28 (1998) 6-23
13. Billionnet A. Using integer programming to solve the train platforming problem. Transportation Science 37 (2003) 213-222
14. Blasum U., Bussieck M.R., Hochstättler W., Moll C., Scheel H.H., and Winter T. Scheduling trams in the morning. Mathematical Methods of Operations Research 49 (2000) 137-148
15. Bodin L., Golden B., Assad A., and Ball M. Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research 10 (1983) 63-211
16. Bouma A., and Oltrogge C. Linienplanung und Simulation für Öffentlichen Verkehrswege in Praxis und Theorie. Eisenbahntechnische Rundschau 43 (1994) 369-378 (in German)
17. Brännlund U., Lindberg P.O., Nöu A., and Nilsson J.E. Railway timetabling using Lagrangian relaxation. Transportation Science 32 (1998) 358-369
18. Brucker J., Hurink J.L., and Rolfes T. Routing of railway carriages: A case study. Journal of Global Optimization 27 (2003) 313-332
19. Bussieck, M.R. (1998). Optimal lines in public rail transport. PhD thesis, TU Braunschweig
20. Bussieck M.R., Kreuzer P., and Zimmermann U.T. Optimal lines for railway systems. European Journal of Operational Research 96 (1996) 54-63
21. Bussieck M.R., Winter T., and Zimmermann U.T. Discrete optimization in public rail transport. Mathematical Programming 79 (1997) 415-444
22. Cai X., and Goh C.J. A fast heuristic for the train scheduling problem. Computers & Operations Research 21 (1994) 499-510
23. Caprara A., Fischetti M., Toth P., Vigo D., and Guida P.L. Algorithms for railway crew management. Mathematical Programming 79 (1997) 125-141
24. Caprara A., Fischetti M., Toth P., and Vigo D. Modeling and solving the crew rostering problem. Operations Research 46 (1998) 820-830
25. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 (1999) 730-743
26. Caprara A., Fischetti M., and Toth P. Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
27. Caprara A., Monaci M., and Toth P. A global method for crew planning in railway applications. In: Daduna J., and Voss S. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 505 (2001), Springer-Verlag, Berlin 17-36
28. Caprara A., Fischetti M., and Toth P. Modeling and solving the train timetabling problem. Operations Research 50 (2002) 851-861
29. Caprara A., Monaci M., and Toth P. Models and algorithms for a staff scheduling problem. Mathematical Programming 98 (2003) 445-476
30. Caprara A., Monaci M., Toth P., and Guida P.L. A Lagrangian heuristic approach to real-world train timetabling problems. Discrete Applied Mathematics 154 (2006) 738-753
31. Carey M., and Carville S. Scheduling and platforming trains at busy complex stations. Transportation Research 37 (2003) 195-224
32. Carey M., and Lockwood D. A model, algorithms and strategy for train pathing. Journal of the Operational Research Society 46 (1995) 988-1005
33. Ceria S., Nobili P., and Sassano A. A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81 (1998) 215-228
34. Chu S., and Chan E. Crew scheduling of light rail transit in Hong Kong: From modeling to implementation. Computers & Operations Research 25 (1998) 887-894
35. Claessens M.T., van Dijk N.M., and Zwaneveld P.J. Cost optimal allocation of passenger lines. European Journal of Operational Research 110 (1998) 474-489
36. Constantino, A.A., de Mendonca Neto, C.F.X., Novaes, A.G. (2006). Crew rostering problem with distribution of workload based on preferences. Annals of Operations Research, in press
37. Cordeau J.-F., Toth P., and Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science 32 (1998) 380-404
38. Cordeau J.-F., Soumis F., and Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research 49 (2001) 531-548
39. In: Daduna J.R., and Voss S. (Eds). Computer-Aided Scheduling of Public Transport. Lecture Notes in Economic and Mathematical Systems vol. 505 (2001), Springer-Verlag, Berlin
40. In: Daduna J.R., and Wren A. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economic and Mathematical Systems vol. 308 (1988), Springer-Verlag, Berlin
41. Dahlhaus E., Horak P., Miller M., and Ryan J.F. The train marshalling problem. Discrete Applied Mathematics 103 (2000) 41-54
42. De Luca Cardillo D., and Mione N. k l-list τ colouring of graphs. European Journal of Operational Research 106 (1998) 160-164
43. Desrosiers J., Dumas Y., Solomon M.M., and Soumis F. Time constrained routing and scheduling. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks in Operations Research and Management Science vol. 8 (1995), Elsevier, Amsterdam 35-139
44. In: Desrochers M., and Rousseau J.M. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economic and Mathematical Systems vol. 386 (1992), Springer-Verlag, Berlin
45. Dienst, H. (1978). Linienplanung in Spurgeführten Personenverkehr mit Hilfe eines Heuristischen Verfahrens, PhD thesis, TU Braunschweig (in German)
46. Di Stefano G., and Koci M.L. A graph theoretical approach to the shunting problem. In: Gerards B. (Ed). Proceedings of ATMOS Workshop 2003. Electronic Notes in Theoretical Computer Science vol. 92 (2004), Elsevier, Amsterdam 16-33
47. Ernst A.T., Jiang H., Krishnamoorthy M., Nott H., and Sier D. An integrated optimization model for train crew management. Annals of Operations Research 108 (2001) 211-224
48. Ernst A.T., Jiang H., Krishnamoorthy M., and Sier D. Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research 153 (2004) 3-27
49. Ernst A.T., Jiang H., Krishnamoorthy M., Owens B., and Sier D. Annotated bibliography of personnel scheduling and rostering. Annals of Operations Research 127 (2004) 21-144
50. Fioole P.-J., Kroon L.G., Maróti G., and Schrijver A. A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research 174 (2006) 1281-1297
51. Fisher M.L., and Kedia P. Optimal solutions of set covering/partitioning problems using dual heuristics. Management Science 36 (1990) 674-688
52. Fores S., Proll L., and Wren A. Experiences with a flexible driver scheduler. In: Daduna J., and Voss S. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 505 (2001), Springer-Verlag, Berlin 137-152
53. Freling R., Lentink R.M., and Odijk M. Scheduling train crews: A case study for the Dutch railways. In: Daduna J., and Voss S. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 505 (2001), Springer-Verlag, Berlin 153-166
54. Freling R., Lentink R.M., and Wagelmans A.P.M. A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm. Annals of Operations Research 127 (2004) 203-222
55. Freling R., Lentink R.M., Kroon L.G., and Huisman D. Shunting of passenger train units in a railway station. Transportation Science 39 (2005) 261-272
56. Gallo G., and di Miele F. Dispatching buses in parking depots. Transportation Science 35 (2001) 322-330
57. Gamache M., and Soumis F. A method for optimally solving the rostering problem. In: Yu G. (Ed). Operations Research in Airline Industry (1998), Kluwer Academic, Boston 124-157
58. Gamache M., Soumis F., Marquis G., and Desrosiers J. A column generation approach for large scale aircrew rostering problems. Operations Research 47 (1999) 247-263
59. Goossens J.H.M., van Hoesel C.P.M., and Kroon L.G. A branch-and-cut approach for solving railway line-planning problems. Transportation Science 38 (2004) 379-393
60. Goossens J.H.M., van Hoesel C.P.M., and Kroon L.G. On solving multi-type railway line planning problems. European Journal of Operational Research 168 (2005) 403-424
61. Hamdouni M., Desaulniers G., Marcotte O., Soumis F., and Van Putten M. Dispatching buses in a depot using block patterns. Transportation Science 40 (2006) 364-377
62. He S., Song R., and Chaudry S.S. Fuzzy dispatching model and genetic algorithms for railyard operations. European Journal of Operational Research 124 (2000) 307-331
63. Higgings A., Kozan E., and Ferreira L. Heuristic techniques for single line train scheduling. Journal of Heuristics 3 (1997) 43-62
64. Huisman D., Kroon L.G., Lentink R.M., and Vromans M.J.C.M. Operations research in passenger railway transportation. Statistica Neerlandica 59 (2005) 467-497
65. Jacobs L.W., and Brusco M.J. A local search heuristic for large set-covering problems. Naval Research Logistics 52 (1995) 1129-1140
66. Jovanovic D., and Harker P.T. Tactical scheduling of rail operations: The SCAN I system. Transportation Science 25 (1991) 46-64
67. Kroon L.G., and Fischetti M. Crew scheduling for the Netherlands railways destination: Customer. In: Daduna J., and Voss S. (Eds). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 505 (2001), Springer-Verlag, Berlin 181-201
68. Kroon L.G., and Peeters L.W.P. A variable trip time model for cyclic railway timetabling. Transportation Science 37 (2003) 198-212
69. Kroon L.G., Romeijn H.E., and Zwaneveld P.J. Routing trains through railway stations: Complexity issues. European Journal of Operational Research 98 (1997) 485-498
70. Kroon, L.G., Dekker, R., Vromans, M.J.C.M. (2005). Cyclic railway timetabling: A stochastic optimization approach. Technical Report ERS-2005-051-LIS, Erasmus University Rotterdam
71. Kwan A., Kwan R., Parker M., and Wren A. Producing train driver schedules under different operating strategies. In: Wilson N. (Ed). Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 471 (2001), Springer-Verlag, Berlin 129-154
72. Lindner, T. (2000). Train schedule optimization in public rail transport. PhD thesis, TU Braunschweig
73. Lingaya N., Cordeau J.-F., Desaulniers G., Desrosiers J., and Soumis F. Operational car assignment at VIA rail Canada. Transportation Research 36 (2002) 755-778
74. Lorena L.A.N., and Lopes F.B. A surrogate heuristic for set covering problems. European Journal of Operational Research 79 (1994) 138-150
75. Maróti G., and Kroon L.G. Maintenance routing for train units: The transition model. Transportation Science 39 (2005) 518-525
76. Maróti G., and Kroon L.G. Maintenance routing for train units: The scenario model. Computers & Operations Research 34 (2007) 1121-1140
77. Morgado E., and Martins J. Scheduling and managing crew in the Portuguese railways. Expert Systems with Applications 5 (1992) 301-321
78. Nachtigall, K. (1999). Periodic network optimization and fixed interval timetables. Habilitation thesis, Deutsches Zentrum für Luft-und Raumfahrt, Braunschweig
79. Nachtigall K., and Voget S. A genetic algorithm approach to periodic railway synchronization. Computers & Operations Research 23 (1996) 453-463
80. Odijk M. A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research 30 (1996) 455-464
81. Oliveira, E., Smith, B.M. (2000). A job-shop scheduling model for the single-track railway scheduling problem. School of Computing Research Report 2000.21, University of Leeds
82. Oltrogge, C. (1994). Linienplanung für Mehrstufige Bedienungssysteme in Öffentlichen Personenverkehr. PhD thesis, TU Braunschweig (in German)
83. Peeters, L.W.P. (2003). Cyclic railway timetable optimization. PhD thesis, Erasmus University Rotterdam
84. Peeters, M., Kroon, L.G. (2003). Circulation of railway rolling stock: A branch-and-price approach. Computers & Operations Research, in press
85. In: Rousseau J.M. (Ed). Computer Scheduling of Public Transport 2 (1985), North-Holland, Amsterdam
86. Ryan D.M. The solution of massive generalized set partitioning problems in aircrew rostering. Journal of the Operational Research Society 43 (1992) 459-467
87. Scholl, S. (2005). Customer-oriented line planning. PhD thesis, University of Kaiserslautern
88. Schrijver A. Minimum circulation of railway stock. CWI Quarterly 6 (1993) 205-217
89. Schrijver, A. (2003). Rangeren op Opstelsporen. Technical report, CWI (in Dutch)
90. Schrijver, A., Steenbeek, A. (1994). Dienstregelingontwikkeling voor Railned. Technical report, CWI (in Dutch)
91. Serafini P., and Ukovich W. A mathematical model for periodic event scheduling problems. SIAM Journal on Discrete Mathematics 2 (1989) 550-581
92. Szpigel B. Optimal train scheduling on a single track railway. In: Ross M. (Ed). Operation Research'72 (1973), North-Holland, Amsterdam 343-351
93. Tien J.M., and Kamiyama A. On manpower scheduling algorithms. SIAM Review 24 (1982) 275-287
94. Tomii N., and Zhou L.J. Depot shunting scheduling using combined genetic algorithms and PERT. In: Brebbia C.A., Allan J., Hill R.J., Sciutto G., and Sone S. (Eds). Computers in Railways VII. Advances in Transport vol. 7 (2000), WIT Press, Southampton 437-446
95. Tomii N., Zhou L.J., and Fukumara N. Shunting scheduling problem at railway stations. In: Imam I.F., Kodratoff Y., El-Dessouki A., and Ali M. (Eds). Lecture Notes in Artificial Intelligence vol. 1611 (1999), Springer-Verlag, Berlin 790-797
96. van den Broek, J.J.J. (2002). Toets op Inplanbaarheid van Rangeerbewegingen. MSc thesis, Eindhoven University of Technology (in Dutch)
97. van't Woudt, C. (2001). Shunting of passenger train units. MSc thesis, Erasmus University Rotterdam
98. Wedelin D. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Annals of Operational Research 57 (1995) 283-301
99. In: Wilson N. (Ed). Computer-Aided Transit Scheduling. Lecture Notes in Economic and Mathematical Systems vol. 471 (1999), Springer-Verlag, Berlin
100. Winter, T. (1999). Online and real-time dispatching problems. PhD thesis, TU Braunschweig
101. Winter T., and Zimmermann U.T. Real-time dispatch of trams in storage yards. Annals of Operations Research 96 (2000) 287-315
102. Wise, T.H. (1995). Column generation and polyhedral combinatorics for airline crew scheduling. PhD thesis, Cornell University
103. In: Wren A. (Ed). Computer Scheduling of Public Transport (1981), North-Holland, Amsterdam
104. Yagiura M., Kishida M., and Ibaraki T. A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research 172 (2006) 472-499
105. Zwaneveld, P.J. (1997). Railway planning and allocation of passenger lines. PhD thesis, Rotterdam School of Management
106. Zwaneveld P.J., Kroon L.G., Romeijn H.E., Salomon M., Dauzère-Pérès S., van Hoesel C.P.M., and Ambergen H.W. Routing trains through railway stations: Model formulation and algorithms. Transportation Science 30 (1996) 181-194
107. Zwaneveld P.J., Kroon L.G., and van Hoesel C.P.M. Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128 (2001) 14-33