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.


    Access

    Download


    Export, share and cite



    Title :

    Recoverable Robust Periodic Timetabling


    Contributors:


    Publication date :

    2023-08-31


    Size :

    16 pages , 766935 byte


    Remarks:

    OASIcs, Vol. 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), pages 9:1-9:16





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Robust Train Timetabling

    Cacchiani, Valentina / Toth, Paolo | Springer Verlag | 2018


    Incremental Heuristics for Periodic Timetabling

    Lindner, Niels / Liebchen, Christian | BASE | 2023

    Free access

    Forward Cycle Bases and Periodic Timetabling

    Lindner, Niels / Liebchen, Christian / Masing, Berenike | BASE | 2021

    Free access

    Periodic Timetabling with Cyclic Order Constraints

    Bortoletto, Enrico / Lindner, Niels / Masing, Berenike | DataCite | 2023

    Free access

    Forward Cycle Bases and Periodic Timetabling

    Lindner, Niels / Liebchen, Christian / Masing, Berenike | BASE | 2021

    Free access