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.
Distributed model predictive control for rescheduling of railway traffic
2014-10-01
373967 byte
Conference paper
Electronic Resource
English
Distributed model predictive control for railway traffic management
Online Contents | 2016
|Railway crew rescheduling with retiming
Online Contents | 2012
|Rescheduling Railway Traffic Taking into Account Minimization of Passengers' Discomfort
British Library Conference Proceedings | 2015
|Reinforcement Learning in Railway Timetable Rescheduling
IEEE | 2020
|Maintenance Appointments in Railway Rolling Stock Rescheduling
Online Contents | 2017