The price of robustness in timetable information

OpenAccess Series in Informatics

Volumn 20, Issue , 2011, Pages 76-87

  Goerigk, Marc ^a   Knoth, Martin ^b   Müller Hannemann, Matthias ^b   Schmidt, Marie ^a   Schöbel, Anita ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Delay scenarios; Experimental study; Strict and light robustness

Indexed keywords

COMPUTATIONAL EXPERIMENT; DELAY SCENARIOS; EXPERIMENTAL STUDY; HIGH SPEED TRAINS; POLYNOMIAL-TIME; PUBLIC TRANSPORT; STRONGLY NP-HARD; TIME-TABLE INFORMATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TRAVEL TIME;

SCHEDULING;

EID: 84882979708     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2011.76     Document Type: Conference Paper

References (14)

1. A. Ben-Tal, L. El Ghaoui, and A. Nemirovski. Robust Optimization. Princeton University Press, Princeton and Oxford, 2009.
2. A. Ben-Tal and A. Nemirovski. Robust convex optimization. Mathematics of Operations Research, 23(4):769-805, 1998.
3. A. Berger, M. Grimmer, and M. Müller-Hannemann. Fully dynamic speed-up techniques for multi-criteria shortest paths searches in time-dependent networks. In P. Festa, editor, Proceedings of SEA 2010, volume 6049 of LNCS, pages 35-46. Springer, Heidelberg, 2010.
4. D. Bertsimas and M. Sim. The price of robustness. Operations Research, 52(1):35-53, 2004.
5. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, and A. Schöbel. Recoverable robustness in shunting and timetabling. In Robust and Online Large-Scale Optimization, volume 5868 of LNCS, pages 28-60. Springer, Heidelberg, 2009.
6. Y. Disser, M. Müller-Hannemann, and M. Schnee. Multi-criteria shortest paths in time-dependent train networks. In C. C. McGeoch, editor, WEA 2008. 7th International Workshop on Experimental Algorithms, Provincetown, MA, USA, volume 5038 of LNCS, pages 347-361. Springer, Heidelberg, 2008.
7. M. Fischetti and M. Monaci. Light robustness. In R. K. Ahuja, R.H. Möhring, and C.D. Zaroliagis, editors, Robust and online large-scale optimization, volume 5868 of LNCS, pages 61-84. Springer, Heidelberg, 2009.
8. M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, and A. Schöbel. The price of robustness in timetable information. Technical report, University Halle-Wittenberg, Institute of Computer Science, 2011.
9. P. Kouvelis and G. Yu. Robust Discrete Optimization and its applications. Kluwer, 1997.
10. C. Liebchen, M. Lübbecke, R. H. Möhring, and S. Stiller. The concept of recoverable robustness, linear programming recovery, and railway applications. In R. K. Ahuja, R.H. Möhring, and C.D. Zaroliagis, editors, Robust and online large-scale optimization, volume 5868 of LNCS, pages 1-27. Springer, Heidelberg, 2009.
11. M. Müller-Hannemann and M. Schnee. Efficient timetable information in the presence of delays. In R. Ahuja, R.-H. Möhring, and C. Zaroliagis, editors, Robust and Online Large-Scale Optimization, volume 5868 of LNCS, pages 249-272. Springer, Heidelberg, 2009.
12. M. Müller-Hannemann, F. Schulz, D. Wagner, and C. Zaroliagis. Timetable information: Models and algorithms. In Algorithmic Methods for Railway Optimization, volume 4395 of LNCS, pages 67-89. Springer, Heidelberg, 2007.
13. M. Schnee. Fully realistic multi-criteria timetable information systems. PhD thesis, Fachbereich Informatik, Technische Universität Darmstadt, 2009. Published in 2010 by Südwestdeutscher Verlag für Hochschulschriften.
14. A.L. Soyster. Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21:1154-1157, 1973.