Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints

Lucas Kletzander, Nysret Musliu

PosterID: 24
picture_as_pdf PDF
library_books Slides
library_books Poster
menu_book BibTeX
When scheduling drivers for public transport, in addition to covering the demand and dealing with the spacial dimension, a range of legal requirements, collective agreements and company policies need to be respected. The level of concentration required while driving leads to strict rules for break assignments. This results in a complex problem where creating cost-efficient and employee-friendly schedules is challenging. This paper deals with bus driver scheduling using the rules of the Austrian collective agreement for private omnibus providers. The contributions are the formalization of the complex Austrian rules for bus drivers, a new set of publicly available instances based on the characteristics of real-life instances, and a metaheuristic solution approach for the problem. The algorithm was able to significantly improve the solutions to real-life instances and is evaluated on the generated instances. Further we provide insight in the necessity of objectives for employee satisfaction and their effects. Our method can even be successfully applied to improve results on a problem with very different constraints from Brasil.

Session E4: Applications
Canb 10/28/2020, 01:00 – 02:00
10/30/2020, 18:00 – 19:00
Paris 10/27/2020, 15:00 – 16:00
10/30/2020, 08:00 – 09:00
NYC 10/27/2020, 10:00 – 11:00
10/30/2020, 03:00 – 04:00
LA 10/27/2020, 07:00 – 08:00
10/30/2020, 00:00 – 01:00