Sciweavers

EOR
2007

A graph-based hyper-heuristic for educational timetabling problems

13 years 5 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyper-heuristic framework, a tabu search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a multi-stage hyper-heuristic where the tabu search employs permutations upon a different number of graph heuristics in two stages. We study this graph-based hyper-heuristic approach within the context of exploring fundamental issues concerning the search space of the hyper-heuristic (the heuristic space) and the solution space. Such issues have not been addressed in other hyper-heuristic research. These approaches are tested on both exam and course benchmark timetabling problems and are compared with the fine-tuned bespoke state-of-theart approaches. The results are within the range of the best...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where EOR
Authors Edmund K. Burke, Barry McCollum, Amnon Meisels, Sanja Petrovic, Rong Qu
Comments (0)