Hybrid Graph Heuristics within a Hyper-Heuristic Approach to Exam Timetabling Problems

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic lists (of graph heuristics) for solving problems and investigated the heuristic lists found by employing knowledge discovery techniques. Two hybrid approaches (involving Saturation Degree and Largest Degree) including one which employs Case Based Reasoning are presented and discussed. Both the Tabu Search based hyper-heuristic and the hybrid approaches are tested on random and real-world exam timetabling problems. Experimental results are comparable with the best state-of-the-art approaches (as measured against established benchmark problems). The results also demonstrate an increased level of generality in our approach.

[1]  Philip M. Morse,et al.  Methods of Operations Research , 1952 .

[2]  Peter John Graham,et al.  The new wave , 1968 .

[3]  J. Gerring.  A case study , 2011, Technology and Society.

[4]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[5]  D. de Werra.  Graphs, hypergraphs and timetabling , 1985 .

[6]  Michael W. Carter,et al.  A Lagrangian Relaxation Approach To The Classroom Assignment Problem , 1989 .

[7]  John Williamson,et al.  Off‐the‐peg or made‐to‐measure? , 1990 .

[8]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[9]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[10]  Edmund K. Burke,et al.  Selected papers from the First International Conference on Practice and Theory of Automated Timetabling , 1995 .

[11]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[12]  David Leake,et al.  Case-Based Reasoning: Experiences, Lessons and Future Directions , 1996 .

[13]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[14]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[15]  Edmund K. Burke,et al.  Automated University Timetabling: The State of the Art , 1997, Comput. J..

[16]  Markus Voelter,et al.  State of the Art , 1997, Pediatric Research.

[17]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

[18]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[19]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[20]  Amnon Meisels,et al.  A Heuristic Incremental Modeling Approach to Course Timetabling , 1998, Canadian Conference on AI.

[21]  Edmund K. Burke,et al.  Initialization Strategies and Diversity in Evolutionary Timetabling , 1998, Evolutionary Computation.

[22]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[23]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[24]  Giuseppe F. Italiano,et al.  New Algorithms for Examination Timetabling , 2000, WAE.

[25]  Sanja Petrovic,et al.  Structured cases in case-based reasoning - re-using and adapting cases for time-tabling problems , 2000, Knowl. Based Syst..

[26]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[27]  Peter J. Stuckey,et al.  A Hybrid Algorithm for the Examination Timetabling Problem , 2002, PATAT.

[28]  P. Cowling,et al.  CHOICE FUNCTION AND RANDOM HYPERHEURISTICS , 2002 .

[29]  E. Burke,et al.  Case Based Heuristic Selection for Examination Timetabling , 2002 .

[30]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[31]  Sanja Petrovic,et al.  Storing and Adapting Repair Experiences in Employee Rostering , 2002, PATAT.

[32]  J. Care.  ‘Off the Peg’ or ‘Made to Measure’ , 2002 .

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

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

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

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

[37]  Graham Kendall,et al.  An investigation of a tabu assisted hyper-heuristic genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[38]  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[39]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Heuristic Orderings for Examination Timetabling , 2004, PATAT.

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

[41]  Edmund K. Burke,et al.  Applications to timetabling , 2004 .

[42]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Ordering Criteria for Examination Timetabling , 2004 .

[43]  Sanja Petrovic,et al.  Multiple-retrieval case-based reasoning for course timetabling problems , 2006, J. Oper. Res. Soc..