Crucial Components of the PEAST Algorithm in Solving Real-World Scheduling Problems

Abstract—A large number of metaheuristics and local search methods have been developed for combinatorial and global optimization. We present our PEAST algorithm which is capable of solving very difficult real-world scheduling problems, such as workforce scheduling, sports scheduling and school timetabling. The goal of this paper is to identify the crucial components of the PEAST algorithm. We believe that recognizing the importance of these components helps other researchers strengthen their population-based and local search methods. In Section III we present three plus one real-world scheduling problems which will be used to measure the importance of the components of the PEAST algorithm. The first problem occurs in scheduling the Finnish Major Ice Hockey League (13). The instance is derived from the 2012-2013 season for which the PEAST algorithm generated the schedule. The second problem occurs in solving the person-based multitask shift generation problem with breaks (17). The instance is derived from the actual problems solved for a Finnish contact center. The third problem occurs in rostering drivers for transport companies (18). The instance is derived from the biggest local transport company in Finland which uses the PEAST algorithm to optimize their driver rosters. The last problem is a school timetabling problem for which we refer to our earlier computational findings. Section IV reports the computational results. The results identify the crucial components of the algorithm. We believe that recognizing the importance of these components helps other researchers to strengthen their population-based and local search methods.

[1]  Kimmo Nurmi,et al.  Solving the person-based multitask shift generation problem with breaks , 2013, 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO).

[2]  Kimmo Nurmi,et al.  Scheduling the Finnish 1st Division Ice Hockey League , 2009, FLAIRS.

[3]  Fred Glover,et al.  Interactive decision software and computer graphics for architectural and space planning , 1985 .

[4]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  P. Preux,et al.  Towards hybrid evolutionary algorithms , 1999 .

[7]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[8]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[9]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[10]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[13]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[14]  K. Nurmi,et al.  Using the PEAST Algorithm to Roster Nurses in an Intensive-Care Unit in a Finnish Hospital , 2012 .

[15]  J. A. M. Schreuder,et al.  Constructing timetables for sport competitions , 1980 .

[16]  Dries R. Goossens,et al.  Optimizing the Unlimited Shift Generation Problem , 2012, EvoApplications.

[17]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[18]  Celso C. Ribeiro,et al.  A Framework for Scheduling Professional Sports Leagues , 2010 .

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Kimmo Nurmi,et al.  Scheduling the finnish major ice hockey league , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

[21]  Fred W. Glover,et al.  ID Walk: A Candidate List Strategy with a Simple Diversification Device , 2004, CP.

[22]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[23]  K. Nurmi,et al.  Optimizing Large-Scale Staff Rostering Instances , 2012 .

[24]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[25]  Kimmo Nurmi,et al.  A Framework for School Timetabling Problem , 2007 .