10.4230/OASICS.ATMOS.2011.76
Goerigk, Marc
Marc
Goerigk
Knoth, Martin
Martin
Knoth
Müller-Hannemann, Matthias
Matthias
Müller-Hannemann
Schmidt, Marie
Marie
Schmidt
Schöbel, Anita
Anita
Schöbel
The Price of Robustness in Timetable Information
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
strict and light robustness
delay scenarios
experimental study
Caprara, Alberto
Alberto
Caprara
Kontogiannis, Spyros
Spyros
Kontogiannis
2011
2011-09-19
2011-09-19
2011-09-19
en
urn:nbn:de:0030-drops-32680
10.4230/OASIcs.ATMOS.2011
978-3-939897-33-0
2190-6807
10.4230/OASIcs.ATMOS.2011
OASIcs, Volume 20, ATMOS 2011
11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
2012
20
7
76
87
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Caprara, Alberto
Alberto
Caprara
Kontogiannis, Spyros
Spyros
Kontogiannis
2190-6807
Open Access Series in Informatics (OASIcs)
2011
20
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
12 pages
919615 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
In timetable information in public transport the goal is to search for a good passenger's path between an origin and a destination. Usually, the travel time and the number of transfers shall be minimized. In this paper, we consider robust timetable information, i.e. we want to identify a path which will bring the passenger to the planned destination even in the case of delays. The classic notion of strict robustness leads to the problem of identifying those changing activities which will never break in any of the expected delay scenarios. We show that this is in general a strongly NP-hard problem. Therefore, we propose a conservative heuristic which identifies a large subset of these robust changing activities in polynomial time by dynamic programming and so allows us to find strictly robust paths efficiently. We also transfer the notion of light robustness, originally introduced for timetabling, to timetable information. In computational experiments we then study the price of strict and light robustness: How much longer is the travel time of a robust path than of a shortest one according to the published schedule? Based on the schedule of high-speed trains within Germany of 2011, we quantitatively explore the trade-off between the level of guaranteed robustness and the increase in travel time. Strict robustness turns out to be too conservative, while light robustness is promising: a modest level of guarantees is achievable at a reasonable price for the majority of passengers.
OASIcs, Vol. 20, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pages 76-87