Railway crew pairing optimization

Authors:
Lennart Bengtsson;Rastislav Galia;Tomas Gustafsson;Curt Hjorring;Niklas Kohl
Affiliations:
Jeppesen AB, Göteborg, Sweden;Jeppesen AB, Göteborg, Sweden;Jeppesen AB, Göteborg, Sweden;Jeppesen AB, Göteborg, Sweden;DSB Planning, Copenhagen K, Denmark and Jeppesen AB, Göteborg, Sweden
Venue:
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Year:
2004

Citing 3
Cited 1

Algorithms for railway crew management

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
A flexible system for scheduling drivers

Journal of Scheduling

Optimizing Railway Crew Scheduling at DB Schenker

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of automatic crew planning tools within the railway industry is now becoming wide-spread, thanks to new algorithm development and faster computers. An example is the large European railway Deutsche Bahn, which is using a commercial crew planning system developed by Jeppesen (formerly Carmen Systems). This paper focuses on the crew pairing problem that arises at major railways. Even though it is similar to the well-studied airline crew pairing problem, the size and complexity of the railway operation necessitates tailored optimization techniques. We show that a column generation approach to the pairing problem, which combines resource constraints, k-shortest path enumeration and label merging techniques, is able to heuristically solve a 7,000 leg pairing problem in less than a day.