Duty Rostering in Public Transport - Facing Preferences, Fairness, and Fatigue

Please always quote using this URN: urn:nbn:de:0297-zib-56070
  • Duty rostering problems occur in different application contexts and come in different flavors. They give rise to very large scale integer programs which ypically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an mprovement method of the Lin-Kernighan type for the solution of duty rostering problems. We illustrate its versatility and solution quality on three different applications in public transit, vehicle routing, and airline rostering with a focus on the management of preferences, fairness, and fatigue, respectively.

Download full text files

Export metadata

  • Export Bibtex
Metadaten
Author:Ralf Borndörfer, Markus Reuther, Thomas Schlechte, Christof Schulz, Elmar Swarat, Steffen Weider
Document Type:ZIB-Report
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Date of first Publication:2015/07/09
Series (Serial Number):ZIB-Report (15-44)
ISSN:1438-0064

$Rev: 13581 $