Driver scheduling based on “driver-friendly” vehicle schedules
In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems.We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements.We introduced a driver friendly approach of the optimization of the scheduling, which is closer to the practice used by public transportation companies.We give test results for this, which are shown as illustrative example for the method in the scheduling of the bus trips of Szeged city, Hungary.
KeywordsCrew Schedule Vehicle Schedule Driver Schedule MILP Solver Vehicle Schedule Problem
Unable to display preview. Download preview PDF.
- 3.Borndörfer, L., Löbel, A., Weider, S.: A Bundle Method for Multi-Depot Integrated Vehicle and Crew Scheduling in Public Transport. Lecture Notes in Economics and Mathematical Systems 600, 3–24 (2008)Google Scholar
- 4.Dávid, B.: Heuristics for the Multiple-Depot Vehicle Scheduling Problem. In: Proceedings of the MATCOS-10 Conference, accepted for publicationGoogle Scholar
- 5.Fischetti, M., Lodi, A., Toth, P.: A branch-and-cut algorithm for the multi depot vehicle scheduling problem. Technical report (1999)Google Scholar
- 7.Huisman, D.: Integrated and Dynamic Vehicle and Crew Scheduling. PhD thesis, Erasmus University of Rotterdam (2004)Google Scholar