Delay-Robust Event Scheduling

Robust optimisation is a well-established concept to deal with uncertainty. In particular, recovery-robust models are suitable for real-world contexts, where a certain amount of recovery---although limited---is often available. In this paper we describe a general framework to optimise event-based problems against delay propagation. We also present a real-world application to train platforming in the Italian railways in order to show the practical effectiveness of our framework.

[1]  Alfredo Navarra,et al.  Recoverable Robust Timetables on Trees , 2009, COCOA.

[2]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[3]  Paolo Toth,et al.  Chapter 3 Passenger Railway Optimization , 2007, Transportation.

[4]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[5]  Rolf H. Möhring,et al.  Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.

[6]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

[7]  Daniele Frigioni,et al.  Recoverable Robustness in Shunting and Timetabling , 2009, Robust and Online Large-Scale Optimization.

[8]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[9]  Matteo Fischetti,et al.  Light Robustness , 2009, Robust and Online Large-Scale Optimization.

[10]  Paolo Toth,et al.  Solution of the Train Platforming Problem , 2011, Transp. Sci..

[11]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[12]  Anita Schöbel,et al.  A Bicriteria Approach for Robust Timetabling , 2009, Robust and Online Large-Scale Optimization.

[13]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[14]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[15]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[16]  Martin W. P. Savelsbergh,et al.  Robust Optimization for Empty Repositioning Problems , 2009, Oper. Res..