Skip to Main content Skip to Navigation
New interface
Conference papers

Recoverable Robust Timetable Information

Abstract : Timetable information is the process of determining a suitable travel route for a passenger. Due to delays in the original timetable, in practice it often happens that the travel route cannot be used as originally planned. For a passenger being already en route, it would hence be useful to know about alternatives that ensure that his/her destination can be reached. In this work we propose a recoverable robust approach to timetable information; i.e., we aim at finding travel routes that can easily be updated when delays occur during the journey. We present polynomial-time algorithms for this problem and evaluate the performance of the routes obtained this way on schedule data of the German train network of 2013 and simulated delay scenarios.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, October 10, 2013 - 3:02:35 PM
Last modification on : Wednesday, November 9, 2022 - 11:20:49 AM
Long-term archiving on: : Friday, April 7, 2017 - 8:59:15 AM


Files produced by the author(s)




Marc Goerigk, Sacha Hesse, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel. Recoverable Robust Timetable Information. ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013, Sep 2013, Sophia Antipolis, France. pp.1--14, ⟨10.4230/OASIcs.ATMOS.2013.1⟩. ⟨hal-00871789⟩



Record views


Files downloads