论文信息 - Tabu Search for Driver Scheduling

Tabu Search for Driver Scheduling

This paper presents a Tabu Search heuristic for driver scheduling problems, which are known to be NP-hard. Multi-neighbourhoods and an appropriate memory scheme, which are essential elements of Tabu Search, have been designed and tailored for the driver scheduling problem. Alternative designs have been tested and compared with best known solutions drawn from real-life data sets. The algorithm is very fast, has achieved results comparable to those based on mathematical programming approaches, and has many potentials for future developments.

Raymond S. K. Kwan | Yindong Shen | R. S. Kwan | Yindong Shen

[1] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .

[2] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .

[3] Anthony Wren,et al. Bus Driver Scheduling — An Overview , 1995 .

[4] Jean-Marc Rousseau,et al. Results Obtained with Crew-Opt: A Column Generation Method for Transit Crew Scheduling , 1995 .

[5] Ann S. K. Kwan,et al. Hybrid genetic algorithms for scheduling bus and train drivers , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6] Anthony Wren,et al. An Improved ILP System for Driver Scheduling , 1999 .

[7] Ann S. K. Kwan,et al. Producing Train Driver Schedules Under Differing Operating Strategies , 1999 .

[8] Nigel H. Wilson,et al. Computer-Aided Transit Scheduling , 1999, Lecture Notes in Economics and Mathematical Systems.

[9] Anthony Wren,et al. A bus crew scheduling system using a set covering formulation , 1988 .

[10] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[11] Ann S. K. Kwan,et al. Driver Scheduling Using Genetic Algorithms with Embedded Combinatorial Traits , 1999 .

[12] D. I. Calvert,et al. Computer Scheduling of Public Transport 2 , 1986 .

[13] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .

[14] G. Mitra,et al. Computer Scheduling of Public Transport , 1982 .