In this paper we consider the problem of shunting train units on a railway station. Train units arrive at and depart from the station according to a given train schedule and in between the units may have to be stored at the station.
The assignment of arriving to departing train units (called matching) and the scheduling of the movements to realize this matching is called shunting. The goal is to realize the shunting using a minimal number of shunt movements.
For a restricted version of this problem an ILP approach has been presented in the literature. In this paper, we consider the general shunting problem and derive a greedy heuristic approach and an exact solution method based on dynamic programming. Both methods are flexible in the sense that they allow the incorporation of practical planning rules and may be extended to cover
additional requirements from practice.
|Title of host publication||Proceedings of the 63rd European Study Group Mathematics with Industry (SWI 2008, Enschede, The Netherlands, January 28-February 1, 2008)|
|Editors||O. Bokhove, J.L. Hurink, G. Meinsma, C.C. Stolk, M.H. Vellekoop|
|Place of Publication||Amsterdam|
|Publisher||Centrum voor Wiskunde en Informatica|
|Publication status||Published - 2008|