In this paper we introduce two distributed model predictive control (DMPC) methods for the rescheduling of railway traffic. In each step of the DMPC approach dispatching actions are determined that reduce the amount of delay in the network as much as possible by solving a mixed integer linear programming (MILP) problem. The constraints of the MILP are based on a model of the railway traffic and network and the possible dispatching actions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Distributed model predictive control for rescheduling of railway traffic


    Contributors:


    Publication date :

    2014-10-01


    Size :

    373967 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Railway crew rescheduling with retiming

    Veelenturf, Lucas P. | Online Contents | 2012


    Rescheduling Railway Traffic Taking into Account Minimization of Passengers' Discomfort

    Corman, Francesco / Pacciarelli, Dario / D Ariano, Andrea et al. | British Library Conference Proceedings | 2015


    Reinforcement Learning in Railway Timetable Rescheduling

    Zhu, Yongqiu / Wang, Hongrui / Goverde, Rob M.P. | IEEE | 2020