Railway rolling stock planning: Robustness against large disruptions

Transportation Science

Volumn 46, Issue 2, 2012, Pages 217-232

  Cacchiani, Valentina ^a   Caprara, Alberto ^a   Galli, Laura ^a   Kroon, Leo ^b,c   Maróti, Gábor ^b   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b ERASMUS UNIVERSITY   (Netherlands)

^c Netherlands Railways   (Netherlands)

Author keywords

Integer linear programming; Rolling stock planning; Two stage optimization

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PASSENGER CARS; RAILROAD ROLLING STOCK; RAILROAD TRANSPORTATION; RAILROADS; STOCHASTIC PROGRAMMING; TRANSPORTATION;

BENDERS DECOMPOSITION; COMPUTATIONAL RESULTS; INTEGER LINEAR PROGRAMMING; MIXED INTEGER LINEAR PROGRAMMING MODEL; RAILWAY ROLLING STOCK; ROBUST CIRCULATION; TWO STAGE OPTIMIZATIONS; TWO-STAGE OPTIMIZATION MODELS;

INTEGER PROGRAMMING;

EID: 84861792464     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1110.0388     Document Type: Article

References (25)

1. Benders, J. 1962. Partitioning procedures for solving mixedvariables programming problems. Numerische Mathematik 4(1) 238-252.
2. Ben-Tal, A., A. Nemirowski. 1998. Robust convex optimization. Math. Oper. Res. 23(4) 769-805.
3. Ben-Tal, A., L. El Ghaoui, A. Nemirowski. 2009. Robust Optimization. Princeton University Press, Princeton, NJ.
4. Bertsimas, D., M. Sim. 2004. The price of robustness. Oper. Res. 52(1) 35-53.
5. Birge, J., F. Louveaux. 1997. Introduction to Stochastic Programming. Springer, New York.
6. Cacchiani, V., A. Caprara, M. Fischetti. 2012. A Lagrangian heuristic for robustness, with an application to train timetabling. Transportation Sci. 46(1).
7. Caprara, A., L. Galli, S. Stiller, P. Toth. 2008. Recoverable-robust platforming by network buffering. Technical Report ARRIVALTR- 0157, ARRIVAL Project, http://www.cti.gr/arrival.
8. Caprara, A., L. Kroon, M. Monaci, M. Peeters, P. Toth. 2007. Passenger railway optimization. C. Barnhart, G. Laporte, eds. Handbooks in Operations Research and Management Science, Vol. 14. Elsevier, Amsterdam, 129-187.
9. Cicerone, S., G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra. 2007. Robust algorithms and price of robustness in shunting problems. C. Liebchen, R. K. Ahuja, J. A. Mesa, eds.
10. Cicerone, S., G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, A. Schöbel. 2009. Recoverable robustness in shunting and timetabling. R. Ahuja, R. Möhring, C. Zaroliagis, eds. Robust and On-Line Large Scale Optimization. Lecture Notes in Computer Science, Vol. 5868. Springer-Verlag, Berlin, 28-60.
11. De Almeida, D., N. Marcos, S. Vianey, C. Weber. 2008. Robustness of rolling stock schedules. Technical Report ARRIVAL-TR-0129, ARRIVAL project, http://www.cti.gr/arrival.
12. Ehrgott, M., D. Ryan. 2002. Constructing robust crew schedules with bicriteria optimization. J. Multi-Criteria Decision Anal. 11(3) 139-150.
13. Erera, A., J. Morales, M. Savelsbergh. 2009. Robust optimization for empty repositioning problems. Oper. Res. 57(2) 468-483.
14. Fioole, P., L. Kroon, G. Maróti, A. Schrijver. 2006. A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174(2) 1281-1297.
15. Fischetti, M., D. Salvagnin, A. Zanette. 2009. Fast approaches to improve the robustness of a railway timetable. Transportation Sci. 43(3) 321-335.
16. Geoffrion, A. 1972. Generalized Benders decomposition. J. Optim. Theory Appl. 10(4) 237-260.
17. Kroon, L., G. Maróti, M. Retel Helmrich, M. Vromans, R. Dekker. 2007. Stochastic improvement of cyclic railway timetables. Transportation Res. Part B 42(6) 553-570.
18. Liebchen, C., M. Lübbecke, R. Möhring, S. Stiller. 2009. The concept of recoverable robustness, linear programming recovery, and railway applications. R. Ahuja, R. Möhring, C. Zaroliagis, eds. Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, Vol. 5868. Springer-Verlag, Berlin, Heidelberg, 1-27.
19. Liebchen, C., M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge. 2010. Computing delay resistant railway timetables. Comput. Oper. Res. 37(5) 857-868.
20. Maróti, G. 2006. Operations research models for railway rolling stock planning. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
21. Nielsen, L. 2008. Disruption generator for railway rolling stock re-scheduling, Software, Erasmus University Rotterdam, The Netherlands.
22. Nielsen, L., L. Kroon, G. Maróti. 2009. A rolling horizon based framework for rolling stock rescheduling. Technical Report ARRIVAL-TR-0205, ARRIVAL Project, http://www.cti.gr/arrival.
23. Shebalov, S., D. Klabjan. 2006. Robust airline crew planning: Moveup crews. Transportation Sci. 40(3) 300-312.
24. Stiller, S. 2008. Extending concepts of reliability, network creation games, real-time scheduling, and robust optimization. Ph.D. thesis, Technische Universität Berlin, Berlin.
25. Yen, J., J. Birge. 2006. A stochastic programming approach to the airline crew scheduling problem. Transportation Sci. 40(1) 3-14.