2026-08-15T23:34:05Z https://drops.dagstuhl.de/oai

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

Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time Dibbelt, Julian Strasser, Ben Wagner, Dorothea Algorithms Optimization Delay-robustness Route planning Public transportation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julian Dibbelt and Ben Strasser and Dorothea Wagner 2014 Is Part Of OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2014.1 urn:nbn:de:0030-drops-47488 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.1 eng https://creativecommons.org/licenses/by/3.0/legalcode