Recoverable Robustness for Railway Rolling Stock Planning

@inproceedings{Cacchiani2008RecoverableRF,
  title={Recoverable Robustness for Railway Rolling Stock Planning},
  author={Valentina Cacchiani and Alberto Caprara and Laura Galli and Leo G. Kroon and G{\'a}bor Mar{\'o}ti},
  booktitle={ATMOS},
  year={2008}
}
In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planning, being interested in recoverability measures that can be computed in practice, thereby evaluating the robustness of rolling stock schedules. In order to lower bound the Price of Recoverability for any set of recovery algorithms, we consider an “optimal” recovery algorithm and propose a Benders decomposition approach to… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
12 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Recoverable robustness

  • C. Liebchen, R. Möhring, M. Lübbecke, S. Stiller
  • Technical Report ARRIVAL-TR-0066, ARRIVAL Project…
  • 2007
Highly Influential
8 Excerpts

Disruption Generator for Railway

  • L. Nielsen
  • Rolling Stock Re-scheduling,
  • 2008
1 Excerpt

G

  • S. Cicerone
  • D’Angelo, G. Di Stefano, D. Frigioni, and A…
  • 2007
2 Excerpts

Operations Research Models for Railway Rolling Stock Planning

  • G. Maróti
  • PhD thesis, Eindhoven University of Technology…
  • 2006
1 Excerpt

Introduction to Stochastic Programming

  • J. Birge, F. Louveaux
  • Springer, New York,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…