Fast Approaches to Improve the Robustness of a Railway Timetable

References

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