A Graph-Based Hyper Heuristic for Timetabling Problems

Burke, Edmund and MacCloumn, Barry and Meisels, Amnon and Petrovic, Sanja and Qu, Rong (2005) A Graph-Based Hyper Heuristic for Timetabling Problems. European Journal of Operational Research . (In Press)

WarningThere is a more recent version of this item available.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
150Kb

Abstract

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 hyperheuristic 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-the-art approaches. The results are within the range of the best results reported in the literature. The approach described here represents a significantly more generally applicable approach than the current state of the art in the literature. Future work will extend this hyper-heuristic framework by employing methodologies which are applicable on a wider range of timetabling and scheduling problems.

Item Type:Article
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:346
Deposited By:Qu, Rong
Deposited On:12 Dec 2005
Last Modified:09 Oct 2007 16:52

Available Versions of this Item

Repository Staff Only: item control page