2026-08-07T05:05:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18770 2024-03-06T10:32:14Z ddc:004 open_access

Recoverable Robust Periodic Timetabling Grafe, Vera Schöbel, Anita Public Transport Recoverable Robustness Periodic Timetabling Delay Management Mixed Integer Programming We apply the concept of recoverable robustness to periodic timetabling, resulting in the Recoverable Robust Periodic Timetabling Problem (RRPT), which integrates periodic timetabling and delay management. Although the computed timetable is periodic, the model is able to take the aperiodicity of the delays into account. This is an important step in finding a good trade-off between short travel times and delay resistance. We present three equivalent formulations for this problem, differing in the way the timetabling subproblem is handled, and compare them in a first experimental study. We also show that our model yields solutions of high quality. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vera Grafe and Anita Schöbel 2023 Is Part Of OASIcs, Volume 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2023.9 urn:nbn:de:0030-drops-187708 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2023.9 eng https://creativecommons.org/licenses/by/4.0/legalcode