Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems

Qu, Rong and Burke, Edmund (2005) Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems. In: The Sixth Metaheuristics International Conference 2005, Aug, 2005, Vienna, Austria.

This is the latest version of this item.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (73kB)

Abstract

This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solutions. The heuristic permutations are then used to construct the solutions. Variable Neighborhood Search, Steepest Descent, Iterated Local Search and Tabu Search are compared. An analysis of their performance within the high level search space of heuristics is also carried out. Experimental results on benchmark exam timetabling problems demonstrate the simplicity and efficiency of this hyperheuristic approach. They also indicate that the choice of the high level search methodology is not crucial and the high level search should explore the heuristic search space as widely as possible within a limited searching time. This simple and general graph based hyperheuristic may be applied to a range of timetabling and optimisation problems.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 28 Feb 2007
Last Modified: 09 Oct 2007 15:52
URI: http://eprints.nottingham.ac.uk/id/eprint/375

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View