Fast approaches to improve the robustness of a railway timetable

Transportation Science

Volumn 43, Issue 3, 2009, Pages 321-335

  Fischetti, Matteo ^a   Salvagnin, Domenico ^a   Zanette, Arrigo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Integer programming; Robust optimization; Robustness; Stochastic programming; Timetabling

Indexed keywords

LINEAR PROGRAMMING; OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS; TRANSPORTATION;

OBJECTIVE FUNCTIONS; OPERATIONAL CONSTRAINTS; OPTIMIZATION TECHNIQUES; RAILWAY TIMETABLES; ROBUST OPTIMIZATION; ROBUST SOLUTIONS; TIMETABLING; TRAIN TIMETABLING PROBLEM;

INTEGER PROGRAMMING;

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

References (23)

1. Barber, F., S. Cicerone, D. Delling, G. D. Stefano, M. Fischetti, L. Kroon, D. Salvagnin, P. Tormos, C. Weber, A. Zanette. 2008. New frameworks for the interaction between robust and online timetable planning, and for monitoring the status quo of the system. Technical Report ARRIVAL-D3.4, ARRIVAL project.
2. Birge, J. R., F. Louveaux. 1997. Introduction to Stochastic Programming, Springer Series in Operations Research and Financial Engineering, 1st ed. Springer, New York.
3. Caprara, A., M. Fischetti, P. Toth. 2002. Modeling and solving the train timetabling problem. Oper. Res. 50 (5)851-861.
4. Caprara, A., M. Monaci, P. Toth, P. Guida. 2006. A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Appl. Math. 154 (5)738-753.
5. Cicerone, S., G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra. 2007. On the interaction between robust timetable planning and delay management. Technical Report ARRIVAL-TR-0116, ARRIVAL project.
6. Clark, C. E. 1961. Importance sampling in Monte Carlo analyses. Oper. Res. 9 (5)603-620.
7. Fischetti, M., M. Monaci. 2008. Light robustness. Technical Report ARRIVAL-TR-0119, ARRIVAL project.
8. Fischetti, M., A. Zanette, D. Salvagnin. 2007. Fast approaches to robust railway timetabling. C. Liebchen, R. K. Ahuja, J. A. Mesa, eds. ATMOS 2007-7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
9. Hofman, M., L. Madsen, J. J. Groth, J. Clausen, J. Larsen. 2006. Robustness and recovery in train scheduling-A case study from DSB S-tog a/s. R. Jacob, M. Müller-Hannemann, eds. ATMOS 2006-6th Workshop on Algorithmic Methods and Models for Optimization of Railways, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
10. ILOG Inc. 2007. ILOG CPLEX 10.1 User's Manual.
11. Kroon, L., R. Dekker, M. Vromans. 2007. Cyclic railway timetabling: A stochastic optimization approach. Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, 41-66.
12. Liebchen, C., L. W. Peeters. 2002. On cyclic timetabling and cycles in graphs. Technical Report 761-2002, Mathematical Institute, TU Berlin.
13. Liebchen, C., S. Stiller. 2006. Delay resistant timetabling. Technical Report ARRIVAL-TR-0056, ARRIVAL project.
14. Liebchen, C., M. Lübbecke, R. H. Möhring, S. Stiller. 2007a. Recoverable robustness. Technical Report ARRIVAL-TR-0066, ARRIVAL-project.
15. Liebchen, C., M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge. 2007b. Computing delay resistant railway timetables. Technical Report ARRIVAL-TR-0071, ARRIVAL project, October.
16. Linderoth, J., A. Shapiro, S. Wright. 2006. The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142 (1)215-241.
17. Loh, W. L. 1996. On Latin hypercube sampling. Ann. Statist. 24 (5)2058-2080.
18. Nachtigall, K. 1999. Periodic network optimization and fixed interval timetables. Habilitation thesis, Deutsches Zentrum für Luft und Raumfahrt, Braunschweig, Germany.
19. Peeters, L. W. P. 2003. Cyclic railway timetable optimization. Ph. D. thesis, Erasmus University, Rotterdam, The Netherlands.
20. Ruszczynski, A., A. Shapiro, eds. 2003. Stochastic Programming (Handbooks in Operations Research and Management Series). Elsevier Publishing Company, Amsterdam.
21. Serafini, P., W. Ukovich. 1989. A mathematical model for periodic scheduling problems. SIJDM: SIAM J. Discrete Math. 2 550-581.
22. Shapiro, A. 2003. Monte Carlo sampling approach to stochastic programming. ESAIM: Proc. 13 65-73.
23. Verweij, B., S. Ahmed, A. J. Kleywegt, G. Nemhauser, A. Shapiro. 2003. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Appl. Optim. 24 (2-3)289-333.