In this paper we present a railway traffic model and a model predictive controller for online railway traffic management of railway networks with a periodic timetable. The main aim of the controller is to recover from delays in an optimal way by changing the departure of trains, by breaking connections, by splitting joined trains, and - in the case of multiple tracks between two stations - by redistributing the trains over the tracks. The railway system is described by a switching max-plus-linear model. We assume that measurements of current running and dwell times and estimates of future running times and dwell times are continuously available so that they can be taken into account in the optimization of the system’s control variables. The switching max-plus-linear model railway model is used to determine optimal dispatching actions, based on the prediction of the future arrival and departure times of the trains, by recasting the dispatching problem as a Mixed Integer Linear Programming (MILP) problem and solving it. Moreover, we use properties from max-plus algebra to rewrite and reduce the model such that the MILP problem can be solved in less time. We also apply the algorithm to a model of the Dutch railway network.
|Number of pages||41|
|Journal||Discrete Event Dynamic Systems: theory and applications|
|Publication status||Published - 2016|
- Max-plus algebra
- Railway networks
- Model reduction