Goerigk, Marc and Heße, Sascha and Müller-Hannemann, Matthias and Schmidt, Marie and Schöbel, Anita (2013) Recoverable robust timetable information. In: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems :. OpenAccess Series in Informatics . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, FRA, pp. 1-14. ISBN 9783939897583
Full text not available from this repository.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.