Scheduling Locomotives and Car Transfers in Freight Transport

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 suc...

Full description

Saved in:
Bibliographic Details
Published in:Transportation science 2008-11, Vol.42 (4), p.478-491
Main Authors: Fugenschuh, Armin, Homfeld, Henning, Huck, Andreas, Martin, Alexander, Yuan, Zhi
Format: Article
Language:English
Subjects:
Automobiles
Commuting
cutting planes
cyclic vehicle scheduling
Focused Section on Rail Transportation
Freight
Freight transport
Heuristic
Heuristics
integer linear programming
Integer programming
Integers
Linear programming
Locomotives
Optimization algorithms
railroad freight transport
Railroad trains
Railroad transportation
Railway transport
Scheduling
Studies
Time windows
Trains
Travel time
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0041-1655
1526-5447
DOI:10.1287/trsc.1080.0248