2026-07-20T14:53:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4240 2024-03-06T10:29:20Z ddc:004 open_access

Recoverable Robust Timetable Information Goerigk, Marc Heße, Sacha Müller-Hannemann, Matthias Schmidt, Marie Schöbel, Anita timetable information recoverable robustness delay scenarios 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marc Goerigk and Sacha Heße and Matthias Müller-Hannemann and Marie Schmidt and Anita Schöbel 2013 Is Part Of OASIcs, Volume 33, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2013.1 urn:nbn:de:0030-drops-42407 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.1 eng https://creativecommons.org/licenses/by/3.0/legalcode