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

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

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Ralf BorndörferORCiD, Markus Reuther, Thomas Schlechte, Christof Schulz, Elmar Swarat, Steffen Weider
Document Type:In Proceedings
Parent Title (English):Proceedings of Conference on Advanced Systems in Public Transport 2015 (CASPT2015)
Year of first publication:2015