Train delays occur often in daily railway operations due to a variety of initiating incidents. On a heavily loaded mainline railway, a single train delay may lead to a series of secondary delays across the network. In this study, the authors describe a peer-to-peer system to solve train rescheduling problems in railway network bottlenecks. A designed Genetic Algorithm is chosen as the local search algorithm on each side. Based on the local search algorithm, different negotiation protocols are raised to find globally feasible solutions. The proposed approach is tested in a railway bottleneck section in the UK, and the computational result is compared with a centralised method to show its performance in terms of computation time and optimality.


    Access

    Access via TIB


    Export, share and cite



    Title :

    Algorithm and peer-to-peer negotiation strategies for train dispatching problems in railway bottleneck sections


    Contributors:
    Liu, Jin (author) / Chen, Lei (author) / Roberts, Clive (author) / Nicholson, Gemma (author) / Ai, Bo (author)

    Published in:

    Publication date :

    2019-09-13


    Size :

    9 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Modeling and Solving Real-Time Train Rescheduling Problems in Railway Bottleneck Sections

    Chen, Lei / Roberts, Clive / Schmid, Felix et al. | IEEE | 2015



    Telephone train dispatching on Oregon electric railway

    Cleveland, William D. | Engineering Index Backfile | 1914


    Train dispatching. The principles of train dispatching

    Anderson, J.A. | Engineering Index Backfile | 1891