10.4230/OASICS.ATMOS.2007.1168
Abbink, Erwin
Erwin
Abbink
Van't Wout, Joel
Joel
Van't Wout
Huisman, Dennis
Dennis
Huisman
07. Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2007
Article
Crew scheduling
large-scale optimization
partitioning
Liebchen, Christian
Christian
Liebchen
Ahuja, Ravindra K.
Ravindra K.
Ahuja
Mesa, Juan A.
Juan A.
Mesa
2007
2007-11-06
2007-11-06
2007-11-06
en
urn:nbn:de:0030-drops-11686
10.4230/OASIcs.ATMOS.2007
978-3-939897-04-0
2190-6807
10.4230/OASIcs.ATMOS.2007
OASIcs, Volume 7, ATMOS 2007
7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)
2012
7
8
96
106
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Liebchen, Christian
Christian
Liebchen
Ahuja, Ravindra K.
Ravindra K.
Ahuja
Mesa, Juan A.
Juan A.
Mesa
2190-6807
Open Access Series in Informatics (OASIcs)
2007
7
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
343590 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
This paper deals with large-scale crew scheduling problems arising
at the Dutch railway operator, Netherlands Railways (NS). We discuss
several methods to partition large instances into several smaller
ones. These smaller instances are then solved with the commercially
available crew scheduling algorithm TURNI. In this paper, we compare
several partitioning methods with each other. Moreover, we report
some results where we applied different partitioning methods after
each other. With this approach, we were able to cut crew costs with
2\% (about 6 million euro per year).
OASIcs, Vol. 7, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07), pages 96-106