This article presents a linear search algorithm based on scanning lines. It resolves calculation of turnback time under conditions of multiple loops of X-type lines, Y-type lines, and ring-type lines in urban rail transit. With this algorithm, a turnback scheme adaptive to passenger flow may be calculated quickly to implement fast and automatic plotting of train diagrams.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Algorithm to Calculate Feasible Turnback Time in Complex Route Conditions


    Contributors:


    Publication date :

    2020-09-01


    Size :

    646304 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Penalties of Nonoptimal Turnback Maneuvers

    Rogers, D F | Online Contents | 2012


    Risk Mitigation Strategies in the Muni Metro Turnback Project

    Sutter, D. A. / American Public Transit Association | British Library Conference Proceedings | 1994


    Muni Metro Turnback Project A Unique Owner-Controlled Insurance Program

    Sutter, D. A. / Grand, K. / American Public Transit Association | British Library Conference Proceedings | 1995


    Context-Aware Policy for Route Planning and Feasible Vehicle Technologies

    Kraus, David / Junk, Carolin / Stang, Marco et al. | IEEE | 2023