Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Aarts, E. and J.K. Lenstra (Eds.) (1997). Local Search in Combinatorial Optimization. Wiley, Chichester.
Fores, S., L. Proll, and A. Wren (1999). An improved ILP system for driver scheduling. In N.H.M. Wilson (Ed.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 471, Springer, Berlin, 43–61.
Glover, F. (1989). Tabu search: Part I. ORSA Journal on Computing 1, 190–206.
Glover, F. (1990). Tabu search: Part II. ORSA Journal on Computing 2, 4–32.
Glover, F. and M. Laguna (1993). Tabu search. In C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, Oxford, 70–150.
Glover, F. and M. Laguna (1997). Tabu Search. Kluwer, Norwell.
Kwan, A.S.K., R.S.K. Kwan, M.E. Parker, and A. Wren (1999). Producing train driver schedules under different operating strategies. In N.H.M. Wilson (Ed.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 471, Springer, Berlin, 129–154.
Kwan, R.S.K., A. Wren, and R.S.K. Kwan (2000). Hybrid genetic algorithms for scheduling bus and train drivers. In Proceedings of the 2000 Congress on Evolutionary Computation, La Jolla, San Diego, 285–292.
Reeves, C.R. (Ed.) (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford.
Rousseau, J.-M. and J. Desrosiers (1995). Results obtained with Crew-Opt: A column generation method for transit crew scheduling. In J.R. Daduna, I. Branco, and J.M.P. Paixão (Eds.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 430, Springer, Berlin, 349–358.
Smith, B.M. and A. Wren (1988). A bus crew scheduling system using a set covering formulation. Transportation Research A 22, 97–108.
Wilson, N.H.M. (Ed.) (1999). Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 471. Springer, Berlin.
Wren, A. and J.-M. Rousseau (1995). Bus driver scheduling — An overview. In J.R. Daduna, I. Branco, and J.M.P. Paixão (Eds.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 430, Springer, Berlin, 173–187.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shen, Y., Kwan, R.S.K. (2001). Tabu Search for Driver Scheduling. In: Voß, S., Daduna, J.R. (eds) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56423-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-56423-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42243-3
Online ISBN: 978-3-642-56423-9
eBook Packages: Springer Book Archive