07. Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning

Authors Erwin Abbink, Joel Van't Wout, Dennis Huisman

Thumbnail PDF


  • Filesize: 335 kB
  • 11 pages

Document Identifiers

Author Details

Erwin Abbink
Joel Van't Wout
Dennis Huisman

Cite AsGet BibTex

Erwin Abbink, Joel Van't Wout, and Dennis Huisman. 07. Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning. In 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07). Open Access Series in Informatics (OASIcs), Volume 7, pp. 96-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


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).
  • Crew scheduling
  • large-scale optimization
  • partitioning


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads