OASIcs.ATMOS.2013.1.pdf
- Filesize: 447 kB
- 14 pages
Document
Recoverable Robust Timetable Information
Authors
-
Part of:
Volume:
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2013)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-09-05
Cite AsGet BibTex
Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, and Anita Schöbel. Recoverable Robust Timetable Information. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 33, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/OASIcs.ATMOS.2013.1
https://doi.org/10.4230/OASIcs.ATMOS.2013.1
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.
Keywords
- timetable information
- recoverable robustness
- delay scenarios
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads