An empirical analysis of robustness concepts for timetabling

OpenAccess Series in Informatics

Volumn 14, Issue , 2010, Pages 100-113

  Goerigk, Marc ^a   Schöbel, Anita ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Algorithm engineering; Robust optimization; Timetabling

Indexed keywords

ALGORITHM ENGINEERING; CLASSICAL ROBUSTNESS; EMPIRICAL ANALYSIS; PRACTICAL IMPORTANCE; PROBLEM STRUCTURE; RESEARCH EFFORTS; ROBUST OPTIMIZATION; TIMETABLING;

ALGORITHMS; OPTIMIZATION;

SCHEDULING;

EID: 84883000832     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2010.100     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. D. Bertsimas and M. Sim. The price of robustness. Operations Research, 52(1):35-53, 2004.
4. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Recoverable robust timetabling: Complexity results and algorithms. Technical Report ARRIVAL-TR-0172, ARRIVAL project, 2008.
5. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra. Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research, 2009.
6. S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Schöbel. Dynamic algorithms for recoverable robustness problems. In Matteo Fischetti and Peter Widmayer, editors, ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl Seminar proceedings, 2008.
7. G. D'Angelo, G. Di Stefano, and A. Navarra. Recoverable robust timetables on trees. Technical Report ARRIVAL-TR-0163, ARRIVAL project, 2008.
8. G. D'Angelo, G. Di Stefano, A. Navarra, and C. M. Pinotti. Recoverable robust timetables: An algorithmic approach on trees. IEEE Transactions on Computers, 2010. to appear.
9. 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 Lecture Note on Computer Science, pages 61-84. Springer, 2009.
10. P. Kouvelis and G. Yu. Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, 1997.
11. C. Liebchen, M. Lüebbecke, 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 Lecture Note on Computer Science. Springer, 2009.
12. M. Schachtebeck and A. Schöbel. Lintim - a toolbox for the experimental evaluation of the interaction of different planning stages in public transportation. Technical report, ARRIVAL Report 206, 2009.
13. A.L. Soyster. Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21:1154-1157, 1973.
14. H. Yaman, O.E. Karasan, and M.C. Pinar. The robust spanning tree problem with interval data. Operations Research Letters, 29:31-40, 2001.