We study the problem of computing delay-robust routes in timetable networks. Instead of a single path we compute a decision graph containing all stops and trains/vehicles that might be relevant. Delays are formalized using a stochastic model. We show how to compute a decision graph that minimizes the expected arrival time while bounding the latest arrival time over all sub-paths. Finally we show how the information contained within a decision graph can compactly be represented to the user. We experimentally evaluate our algorithms and show that the running times allow for interactive usage on a realistic train network.
@InProceedings{dibbelt_et_al:OASIcs.ATMOS.2014.1, author = {Dibbelt, Julian and Strasser, Ben and Wagner, Dorothea}, title = {{Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {1--14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.1}, URN = {urn:nbn:de:0030-drops-47488}, doi = {10.4230/OASIcs.ATMOS.2014.1}, annote = {Keywords: Algorithms, Optimization, Delay-robustness, Route planning, Public transportation} }
Feedback for Dagstuhl Publishing