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

Weider Abstract Duty rostering problems occur in dierent application contexts and come in dierent avors. They give rise to very large scale integer programs which typically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an improvement method of the Lin-Kernighan type for the solution of duty rostering problems. We illustrate its versatility and solution quality on three dierent applications in public transit, vehicle routing, and airline rostering with a focus on the management of preferences, fairness, and fatigue, respec- tively.