摘要：We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-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 dependend travel times, and a transfer of wagons between trains. The model is formulated as an integer programming problem, and solutions are obtained using commercial standard software. Computational results for several test instances are presented.
关键词：Freight Transport; Vehicle Scheduling; Time Windows; Integer Programming
