×

zbMATH — the first resource for mathematics

The concept of recoverable robustness, linear programming recovery, and railway applications. (English) Zbl 1266.90044
Ahuja, Ravindra K. (ed.) et al., Robust and online large-scale optimization. Models and techniques for transportation systems. Berlin: Springer (ISBN 978-3-642-05464-8/pbk). Lecture Notes in Computer Science 5868, 1-27 (2009).
Summary: We present a new concept for optimization under uncertainty: recoverable robustness. A solution is recovery robust if it can be recovered by limited means in all likely scenarios. Specializing the general concept to linear programming we can show that recoverable robustness combines the flexibility of stochastic programming with the tractability and performances guarantee of the classical robust approach. We exemplify recoverable robustness in delay resistant, periodic and aperiodic timetabling problems, and train platforming.
For the entire collection see [Zbl 1176.90003].

MSC:
90B06 Transportation, logistics and supply chain management
90B35 Deterministic scheduling theory in operations research
90C05 Linear programming
PDF BibTeX Cite
Full Text: DOI