We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.


    Access

    Download


    Export, share and cite



    Title :

    Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path


    Additional title:

    Public Transp


    Contributors:

    Published in:

    Public Transport ; 13 , 3 ; 597-623


    Publication date :

    2021-10-01


    Size :

    27 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Why Does a Railway Infrastructure Company Need an Optimized Train Path Assignment for Industrialized Timetabling?

    Feil, Matthias / Pöhle, Daniel | British Library Conference Proceedings | 2014


    Cyclic train timetabling model for high speed railway

    Ding, Shishun / Li, Dewei | IEEE | 2016


    Robust Train Timetabling

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