Journal
TRANSPORTATION SCIENCE
Volume 42, Issue 4, Pages 478-491Publisher
INFORMS
DOI: 10.1287/trsc.1080.0248
Keywords
railroad freight transport; cyclic vehicle scheduling; time windows; integer linear programming; heuristics; cutting planes
Ask authors/readers for more resources
We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multicommodity minimum cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account such as cyclic departures of the trains, time windows on starting and arrival times, network load-dependent travel times, and a transfer of cars between trains. The model is formulated as an integer linear programming problem (ILP). The formulation is improved by preprocessing and additional cutting planes. Solutions are obtained using a randomized greedy heuristic in combination with commercial ILP solvers. Computational results are presented for several real-world test instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available