Copyright
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-11686
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1168/
Abbink, Erwin ; Van't Wout, Joel ; Huisman, Dennis

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

pdf-format:
Dokument 1.pdf (336 KB)

Abstract

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).

BibTeX - Entry

@InProceedings{abbink_et_al:DSP:2007:1168,
  author =	{Erwin Abbink and Joel Van't Wout and Dennis Huisman},
  title =	{07. Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning},
  booktitle =	{ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems},
  year =	{2007},
  editor =	{Christian Liebchen and Ravindra K. Ahuja and Juan A. Mesa},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1168},
  annote =	{Keywords: Crew scheduling, large-scale optimization, partitioning},
  ISBN =	{978-3-939897-04-0}
}

Keywords: Crew scheduling, large-scale optimization, partitioning
Seminar: ATMOS 2007 - 7th Workshop on Algorithmic Methods and Models for Optimization of Railways
Documenttype: InProceedings
Issue date: 2007
Date of publication: 06.11.2007

DROPS-Home | Fulltext Search | Imprint Published by LZI