Schulz, Christof
Refine
Document Type
- ZIB-Report (6)
- Article (3)
- In Proceedings (3)
- Other (1)
Language
- English (13)
Is part of the Bibliography
- no (13)
Keywords
- duty scheduling (2)
- duty templates (2)
- Benders decomposition (1)
- Column Generation (1)
- Crew Planning (1)
- Depot Planning (1)
- Railway Track Assignment (1)
- Variable-Depth Neighborhood Search (1)
- driver satisfaction (1)
- rostering (1)
Institute
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.
Duty Scheduling Templates
(2012)
We propose duty templates as a novel concept to produce similar duty schedules for similar days of operation in public transit. Duty templates can conveniently handle various types of similarity requirements, and they can be implemented with ease using standard algorithmic techniques. They have produced good results in practice.
Duty Scheduling Templates
(2012)
We propose duty templates as a novel concept to produce similar duty
schedules for similar days of operation in public transit. Duty templates
can conveniently handle various types of similarity requirements, and
they can be implemented with ease using standard algorithmic techniques.
They have produced good results in practice.