Skip to main content

Improved Squeaky Wheel Optimisation for Driver Scheduling

  • Conference paper
Book cover Parallel Problem Solving from Nature - PPSN IX (PPSN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4193))

Included in the following conference series:

Abstract

This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation’s (SWO) effectiveness and execution speed by incorporating two additional steps of Selection and Mutation which implement evolution within a single solution. In the ISWO, a cycle of Analysis-Selection-Mutation-Prioritization-Construction continues until stopping conditions are reached. The Analysis step first computes the fitness of a current solution to identify troublesome components. The Selection step then discards these troublesome components probabilistically by using the fitness measure, and the Mutation step follows to further discard a small number of components at random. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Prioritization step to first produce priorities that determine an order by which the following Construction step then schedules the remaining components. Therefore, the optimisation in the ISWO is achieved by solution disruption, iterative improvement and an iterative constructive repair process performed. Encouraging experimental results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aickelin, U.: An Indirect Genetic Algorithm for Set Covering Problems. Journal of the Operational Research Society 53(10), 1118–1126 (2002)

    Article  Google Scholar 

  • Aickelin, U., Li, J.: An Estimation of Distribution Algorithm for Nurse Scheduling. Annals of Operations Research (in print, 2006)

    Google Scholar 

  • Aickelin, U., Dowsland, K.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling 3(3), 139–153 (2000)

    Article  MathSciNet  Google Scholar 

  • Aickelin, U., Dowsland, K.: An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research 31, 761–778 (2003)

    Article  Google Scholar 

  • Aickelin, U., White, P.: Building better nurse scheduling algorithms. Annals of Operations Research 128, 159–177 (2004)

    Article  Google Scholar 

  • Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A Time-Predefined Local Search Approach to Exam Timetabling Problems. IIE Transactions 36(6), 509–528 (2004)

    Article  Google Scholar 

  • Burke, E.K., Causmaecker, P., Vanden Berghe, G., Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7(6), 441–499 (2004)

    Article  MathSciNet  Google Scholar 

  • Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6), 451–470 (2003)

    Article  Google Scholar 

  • Burke, E.K., Newall, J.P.: Solving Examination Timetabling Problems through Adaptation of Heuristic Orderings. Annals of Operations Research 129, 107–134 (2004)

    Article  MathSciNet  Google Scholar 

  • Burke, E.K., Newall, J.P.: Enhancing Timetable Solutions with Local Search Methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 195–206. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Easton, F.F., Mansour, N.: A distributed genetic algorithm for deterministic and stochastic labor scheduling problems. European Journal of Operational Research 118, 505–523 (1999)

    Article  Google Scholar 

  • Ernst, A.T., Jiang, H., et al.: Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research 153, 3–27 (2004)

    Article  MathSciNet  Google Scholar 

  • Fores, S., Proll, L., Wren, A.: TRACS II: a hybrid IP/heuristic driver scheduling system for public transport. Journal of the OR Society 53, 1093–1100 (2002)

    MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  • Kwan, R.S.K., Kwan, A.S.K., Wren, A.: Evolutionary driver scheduling with relief chains. Evolutionary Computation 9, 445–460 (2001)

    Article  Google Scholar 

  • Li, J.: Fuzzy Evolutionary Approach for Bus and Rail Driver Scheduling. PhD Thesis, University of Leeds, UK (2002)

    Google Scholar 

  • Li, J., Kwan, R.S.K.: A fuzzy genetic algorithm for driver scheduling. European Journal of Operational Research 147, 334–344 (2003)

    Article  Google Scholar 

  • Li, J., Kwan, R.S.K.: A self-adjusting algorithm for driver scheduling. Journal of Heuristics 11, 351–367 (2005)

    Article  Google Scholar 

  • Joslin, D.E., Clements, D.P.: Squeak wheel optimisation. Journal of Artificial Intelligence 10, 353–373 (1999)

    MATH  Google Scholar 

  • Scott, S., Simpson, R.M.: Case-bases incorporating scheduling constraint dimensions: experiences in nurse rostering. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS (LNAI), vol. 1488, pp. 392–401. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  • Shen, Y., Kwan, R.S.K.: Tabu search for driver scheduling. In: Computer-Aided Scheduling of Public Transport, pp. 121–135. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  • VoĂź, S., Daduna, J.R. (eds.): Computer-Aided Scheduling of Public Transport, Proceedings. Springer, Berlin, Germany (2001)

    Google Scholar 

  • Wren, A., Wren, D.O.: A genetic algorithm for public transport driver scheduling. Computers and Operations Research 22, 101–110 (1995)

    Article  Google Scholar 

  • Wren, A., Rousseau, J.M.: Bus driver scheduling – an overview. In: Computer -Aided Transit Scheduling, pp. 173–187. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aickelin, U., Burke, E.K., Li, J. (2006). Improved Squeaky Wheel Optimisation for Driver Scheduling. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-GuervĂłs, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_19

Download citation

  • DOI: https://doi.org/10.1007/11844297_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38990-3

  • Online ISBN: 978-3-540-38991-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics