Abstract
A hybrid approach for bus driver scheduling is described, which incorporates Genetic Algorithms (GAs), a rule-based driver duties Estimator, and an integer linear programming method called IMPACS. IMPACS produces near-optimal schedules. However, a scheduling run might take hours, and larger problems may have to be decomposed into sub-problems. Earlier research indicates that GAs for directly producing driver schedules are quick, but so far they tend to converge at suboptimal solutions. In the hybrid approach, GAs take on an indirect role. They do not form schedules, but instead would yield a population of vastly condensed versions of the problem. IMP ACS is then applied using the elite population members to yield the optimal schedule almost trivially. The Estimator plays an essential role in the evaluation of population members during the evolution process. The resulting scheduling system captures the complementary strengths of its components and has potential for solving large problems optimally and quickly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Clement, A. Wren, “Greedy genetic algorithms, optimising mutations and bus driver scheduling”, to appear in J.R. Daduna and I. Paixao (eds.) Computer-aided transit, scheduling. Springer-Verlag, Berlin (also available as University of Leeds School of Computer Studies report 93.28, 1993), 1994.
J.R. Daduna, M. Mojsilovi, “Computer-aided vehicle and duty scheduling using the HOT programme system”, In J.R. Daduna and A. Wren (eds.) Computer-aided transit scheduling. Springer-Verlag, Berlin, pp.133–146, 1988.
L. Davis (ed.). “Handbook of genetic algorithms”, Van Nostrand Reinhold, New York, 1991.
R.S.K. Kwan, A. Wren, L. Zhao, “Driver scheduling using intelligent estimation techniques”, In M. Desrochers and J-M. Rousseau (eds.) Computer-aided transit scheduling, Springer-Verlag, Berlin, pp.379–394, 1992.
M.E. Parker, A. Wren, R.S.K. Kwan, “Modelling the scheduling of train drivers”, To appear in J.R. Daduna and J. Paixao (eds.) Computer-aided transit scheduling. Springer-Verlag, Berlin(also available as University of Leeds School of Computer Studies report 93.27, 1993), 1994.
J-M. Rousseau, R. Lessard, J-Y Blais, “Enhancements to the HASTUS crew scheduling algorithm”, In J-M Rousseau (ed.) Computer scheduling of public transport - 2. North-Holland, Amsterdam, pp.295–310, 1985.
B.M. Smith, A. Wren, “A bus crew scheduling system using a set covering formulation”, Transportation Science, 22A, pp.97–108, 1988.
A. Wren, J-M. Rousseau, “Bus driver scheduling - an overview”, To appear in I.R. Daduna and J. Paixao (eds.) Computer aided transit scheduling - 3, Springer-Verlag, Berlin (also available as University of Leeds School of Computer Studies report 93.31, 1993), 1994.
A. Wren, B.M. Smith, “Experiences with a crew scheduling system based on set covering”, In J.R. Daduna and A. Wren (eds.) Computeraided transit scheduling. Springer-Verlag, Berlin, pp.l04–118, 1988.
A. Wren, D.O. Wren, “A genetic algorithm for public transport driver scheduling”, Computers and Operations Research, Vo1.22, No.1, pp. 101–110, 1995.
L. Zhao, A. Wren, R.S.K. Kwan, “Enriching rules in a driver duty estimator”, To appear in J.R. Daduna and J. Paixao (eds.) Computer aided transit scheduling, Springer-Verlag, Berlin (also available as University of Leeds School of Computer Studies report 93.22, 1993), 1994.
L. Zhao, A. Wren, R.S.K. Kwan, “Development of a driver duty estimator”, To appear in Journal of Operational Research Society, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin. Heidelberg
About this paper
Cite this paper
Kwan, R.S.K., Wren, A. (1996). Hybrid Genetic Algorithms for Bus Driver Scheduling. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-85256-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85258-9
Online ISBN: 978-3-642-85256-5
eBook Packages: Springer Book Archive