OASIcs.ATMOS.2007.1168.pdf
- Filesize: 335 kB
- 11 pages
Document
07. Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
Authors
-
Part of:
Volume:
7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07) (ATMOS 2007)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2007-11-06
Cite As Get 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)
https://doi.org/10.4230/OASIcs.ATMOS.2007.1168
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).
Subject Classification
Keywords
- Crew scheduling
- large-scale optimization
- partitioning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads