Improved Squeaky Wheel Optimisation for Driver Scheduling

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.

[1]  Uwe Aickelin,et al.  An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..

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

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

[4]  Anthony Wren,et al.  TRACS II: a hybrid IP/heuristic driver scheduling system for public transport , 2002, J. Oper. Res. Soc..

[5]  Sam R. Thangiah,et al.  Computer-aided Scheduling of Public Transport , 2003, J. Sched..

[6]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[7]  Jingpeng Li,et al.  Fuzzy evolutionary approaches for bus and rail driver scheduling , 2002 .

[8]  ANTHONY WREN,et al.  A genetic algorithm for public transport driver scheduling , 1995, Comput. Oper. Res..

[9]  Stefan Voß,et al.  Computer-Aided Scheduling of Public Transport , 2001 .

[10]  Raymond S. K. Kwan,et al.  Tabu Search for Driver Scheduling , 2001 .

[11]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

[12]  Jingpeng Li,et al.  A Self-Adjusting Algorithm for Driver Scheduling , 2005, J. Heuristics.

[13]  Steve Scott,et al.  Case-Bases Incorporating Scheduling Constraint Dimensions - Experiences in Nurse Rostering , 1998, EWCBR.

[14]  Uwe Aickelin,et al.  Building Better Nurse Scheduling Algorithms , 2004, Ann. Oper. Res..

[15]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .

[16]  Ann S. K. Kwan,et al.  Evolutionary Driver Scheduling with Relief Chains , 2001, Evolutionary Computation.

[17]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[18]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling IV , 2002, Lecture Notes in Computer Science.

[21]  Edmund K. Burke,et al.  Solving Examination Timetabling Problems through Adaption of Heuristic Orderings , 2004, Ann. Oper. Res..

[22]  U Aickelin An indirect genetic algorithm for set covering problems , 2002, J. Oper. Res. Soc..

[23]  Barry Smyth,et al.  Advances in Case-Based Reasoning , 1996, Lecture Notes in Computer Science.

[24]  Uwe Aickelin,et al.  Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.

[25]  Raymond S. K. Kwan,et al.  A fuzzy genetic algorithm for driver scheduling , 2003, Eur. J. Oper. Res..

[26]  Edmund K. Burke,et al.  Enhancing Timetable Solutions with Local Search Methods , 2002, PATAT.

[27]  Nashat Mansour,et al.  A distributed genetic algorithm for deterministic and stochastic labor scheduling problems , 1999, Eur. J. Oper. Res..

[28]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..