English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Railway crew pairing optimization

MPS-Authors

Bengtsson,  Lennart
External Organizations;
External Author, MPI for Meteorology, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bengtsson, L., Galia, R., Gustafsson, T., Hjorring, C., & Kohl, N. (2007). Railway crew pairing optimization. In F. Geraets (Ed.), Algorithmic methods for railway optimization (pp. 126-144).


Cite as: https://hdl.handle.net/21.11116/0000-000D-04C2-3
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 Balm, 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.