Knowledge Discovery in a Hyper-heuristic for Course Timetabling Using Case-Based Reasoning

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term hyper-heuristics has recently been employed to refer to “heuristics that choose heuristics” rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can operate with greater generality than is currently possible. The basic idea behind this is that we maintain a case base of information about the most successful heuristics for a range of previous timetabling problems to predict the best heuristic for the new problem in hand using the previous knowledge. Knowledge discovery techniques are used to carry out the training on the CBR system to improve the system performance on the prediction. Initial results presented in this paper are good and we conclude by discussing the considerable promise for future work in this area.

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

[2]  Padraig Cunningham,et al.  Knowledge engineering issues in developing a case-based reasoning application , 1999, Knowl. Based Syst..

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

[4]  Panagiotis Stamatopoulos,et al.  A Generic Object-Oriented Constraint-Based Model for University Course Timetabling , 2000, PATAT.

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

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

[7]  Sanja Petrovic,et al.  Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach , 2001, ICCBR.

[8]  H. Terashima-Marín,et al.  Evolution of Constraint Satisfaction strategies in examination timetabling , 1999 .

[9]  Peter Ross,et al.  Peckish Initialisation Strategies for Evolutionary Timetabling , 1995, PATAT.

[10]  Jean Berger,et al.  A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows and Itinerary Constraints , 1999, GECCO.

[11]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..

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

[13]  Atilla Bezirgan.  A case-based approach to scheduling constraints , 1993 .

[14]  Jörg Rech,et al.  Knowledge Discovery in Databases , 2001, Künstliche Intell..

[15]  Peter Ross,et al.  A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems , 1994, ECAI.

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

[17]  Alex A. Freitas,et al.  A survey of evolutionary algorithms for data mining and knowledge discovery , 2003 .

[18]  Lloyd A. Smith,et al.  Practical feature subset selection for machine learning , 1998 .

[19]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[20]  Edmund K. Burke,et al.  Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II , 1997 .

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

[22]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

[24]  Peter Ross,et al.  Solving a Real-World Problem Using an Evolving Heuristically Driven Schedule Builder , 1998, Evolutionary Computation.

[25]  Günter Schmidt,et al.  Case-based reasoning for production scheduling , 1998 .

[26]  Barry Smyth,et al.  Case-Based Reasoning in Scheduling: Reusing Solution Components. , 1996 .

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

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

[29]  Edmund K. Burke,et al.  Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III , 2000 .

[30]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[31]  Margarida Vaz Pato,et al.  A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem , 2000, PATAT.

[32]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

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

[34]  Edmund K. Burke,et al.  A simple heuristically guided search for the timetabling problem , 1998 .

[35]  Kazuo Miyashita,et al.  CABINS: A Framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair , 1995, Artif. Intell..

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