Reference
B. Kersbergen, T. van den Boom, and B. De Schutter, "Reducing the time needed
to solve the global rescheduling problem for railway networks,"
Proceedings of the 16th International IEEE Conference on Intelligent
Transportation Systems (ITSC 2013), The Hague, The Netherlands, pp.
791-796, Oct. 2013.
Abstract
In this paper a method is introduced to reduce the computation time needed to
solve the global rescheduling problem for railway networks. The railway network
is modeled as a switching max-plus-linear model. This model is used to
determine the constraints of the rescheduling problem. The rescheduling problem
is described as a Mixed Integer Linear Programming (MILP) problem. The
dispatching actions in this implementation are limited to changing the order of
the trains and breaking connections at stations. These dispatching actions are
most effective for smaller delays. It is therefore assumed that the delays are
less than some maximum value. The proposed reduction method determines which
(combinations of) control inputs will never be used if the delays are below
this maximum value and removes them, as well as the constraints associated to
them, resulting in a smaller model. Using the reduced model in the MILP problem
significantly decreases the time needed to solve the MILP problem while still
yielding the optimal solution for the original MILP problem.
Downloads
BibTeX
@inproceedings{Kervan:13-032,
author = {Kersbergen, Bart and van den Boom, Ton and De Schutter, Bart},
title = {Reducing the Time Needed to Solve the Global Rescheduling
Problem for Railway Networks},
booktitle = {Proceedings of the 16th International IEEE Conference on
Intelligent Transportation Systems (ITSC 2013)},
address = {The Hague, The Netherlands},
pages = {791--796},
month = oct,
year = {2013}
}