Recoverable Robust Timetable Information - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Recoverable Robust Timetable Information


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.
Fichier principal
Vignette du fichier
2.pdf (447.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00871789 , version 1 (10-10-2013)



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⟩


183 View
284 Download



Gmail Facebook X LinkedIn More