A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems

Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this article, a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain, and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state of the art.

[1]  Mike Wright,et al.  School Timetabling Using Heuristic Search , 1996 .

[2]  Ender Özcan,et al.  A stochastic local search algorithm with adaptive acceptance for high-school timetabling , 2016, Ann. Oper. Res..

[3]  Barry McCollum,et al.  The Third International Timetabling Competition , 2012, Ann. Oper. Res..

[4]  Marcone J. F. Souza,et al.  GOAL solver: a hybrid local search based solver for high school timetabling , 2016, Ann. Oper. Res..

[5]  Ed Keedwell,et al.  A Sequence-based Selection Hyper-heuristic Utilising a Hidden Markov Model , 2015, GECCO.

[6]  Agostinho C. Rosa,et al.  School Timetabling using Genetic Search , 1997 .

[7]  Jeffrey H. Kingston.  A Tiling Algorithm for High School Timetabling , 2004, PATAT.

[8]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[9]  Edward Keedwell,et al.  Markov Chain Selection Hyper-heuristic for the Optimisation of Constrained Magic Squares , 2015 .

[10]  Grigorios N. Beligiannis,et al.  A hybrid particle swarm optimization based algorithm for high school timetabling problems , 2012, Appl. Soft Comput..

[11]  Ender Özcan,et al.  An Experimental Study on Hyper-heuristics and Exam Timetabling , 2006, PATAT.

[12]  Luiz Antonio Nogueira Lorena,et al.  A Constructive Evolutionary Approach to School Timetabling , 2001, EvoWorkshops.

[13]  W. Kruskal.  Historical Notes on the Wilcoxon Unpaired Two-Sample Test , 1957 .

[14]  Nelishia Pillay,et al.  A survey of school timetabling research , 2014, Ann. Oper. Res..

[15]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[16]  Ahmed Kheiri,et al.  Multi-stage hyper-heuristics for optimisation problems , 2014 .

[17]  Edmund K. Burke,et al.  Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.

[18]  Nelishia Pillay,et al.  An application of genetic algorithms to the school timetabling problem , 2008, SAICSIT '08.

[19]  G. Dueck.  New optimization heuristics , 1993 .

[20]  Stephen C. H. Leung,et al.  A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems , 2010, Eur. J. Oper. Res..

[21]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

[22]  Jeffrey H. Kingston,et al.  An XML format for benchmarks in High School Timetabling , 2010, Ann. Oper. Res..

[23]  Juan J. Flores,et al.  Solving a School Timetabling Problem Using a Bee Algorithm , 2008, MICAI.

[24]  Morten W Fagerland,et al.  The Wilcoxon–Mann–Whitney test under scrutiny , 2009, Statistics in medicine.

[25]  Efthymios Housos,et al.  School timetabling for quality student and teacher schedules , 2009, J. Sched..

[26]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

[27]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[28]  Ender Özcan,et al.  Solving high school timetabling problems worldwide using selection hyper-heuristics , 2015, Expert Syst. Appl..

[29]  G. Kendall,et al.  Channel assignment optimisation using a hyper-heuristic , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

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

[31]  E. Burke,et al.  A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .

[32]  Hermann Gehring,et al.  Timetabling at German Secondary Schools: Tabu Search versus Constraint Programming , 2006 .

[33]  Efthymios Housos,et al.  Constraint programming approach for school timetabling , 2003, Comput. Oper. Res..

[34]  Edward Keedwell,et al.  Sequence Analysis-based Hyper-heuristics for Water Distribution Network Optimisation☆ , 2015 .

[35]  Tim Fischer,et al.  Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results , 2001, EvoWorkshops.

[36]  M. C. S. Boeres,et al.  An approach for the Class/Teacher Timetabling Problem using Graph Coloring , 2008 .

[37]  Simon Kristiansen,et al.  International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm , 2012 .

[38]  Nelishia Pillay,et al.  A comparison of genetic algorithms and genetic programming in solving the school timetabling problem , 2012, 2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC).

[39]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

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

[41]  Norbert Oster,et al.  A Hybrid Genetic Algorithm for School Timetabling , 2002, Australian Joint Conference on Artificial Intelligence.

[42]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for assigning teachers to courses , 2002 .

[43]  Bogumil Ulanicki,et al.  Computing and control for the water industry (CCWI2015) , 2015 .

[44]  L. Baum,et al.  Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .

[45]  Ender Özcan,et al.  A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..

[46]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[47]  Edmund K. Burke,et al.  A greedy gradient-simulated annealing selection hyper-heuristic , 2013, Soft Comput..

[48]  Kate A. Smith,et al.  Hopfield neural networks for timetabling: formulations, methods, and comparative results , 2003 .

[49]  Eduardo G. Carrano,et al.  Late acceptance hill-climbing for high school timetabling , 2016, J. Sched..

[50]  Grigorios N. Beligiannis,et al.  Applying evolutionary computation to the school timetabling problem: The Greek case , 2008, Comput. Oper. Res..

[51]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[52]  Arnaldo Vieira Moura,et al.  A GRASP strategy for a more constrained School Timetabling Problem , 2010 .

[53]  Jörg Homberger,et al.  An Evolutionary Algorithm for High School Timetabling , 2012 .

[54]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..