Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- 1 September 2009
- journal article
- Published by Informa UK Limited in Journal of the Operational Research Society
- Vol. 60 (9), 1273-1285
- https://doi.org/10.1057/jors.2008.102
Abstract
A significant body of recent literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph-based hyper-heuristic (GHH) framework, under which a number of local search-based algorithms (as the high level heuristics) are studied to search upon sequences of low-level graph colouring heuristics. To gain an in-depth understanding on this new framework, we address some fundamental issues concerning neighbourhood structures and characteristics of the two search spaces (namely, the search spaces of the heuristics and the actual solutions). Furthermore, we investigate efficient hybridizations in GHH with local search methods and address issues concerning the exploration of the high-level search and the exploitation ability of the local search. These, to our knowledge, represent entirely novel directions in hyper-heuristics. The efficient hybrid GHH obtained competitive results compared with the best published results for both benchmark course and exam timetabling problems, demonstrating its efficiency and generality across different problem domains. Possible extensions upon this simple, yet general, GHH framework are also discussedKeywords
This publication has 27 references indexed in Scilit:
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problemJournal of the Operational Research Society, 2007
- A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design IssuesIEEE Transactions on Evolutionary Computation, 2005
- A time-predefined local search approach to exam timetabling problemsIIE Transactions, 2004
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Algorithm portfoliosArtificial Intelligence, 2001
- Constraint satisfaction problems: Algorithms and applicationsEuropean Journal of Operational Research, 1999
- A multistage evolutionary algorithm for the timetable problemIEEE Transactions on Evolutionary Computation, 1999
- Automated University Timetabling: The State of the ArtThe Computer Journal, 1997
- Examination Timetabling: Algorithmic Strategies and ApplicationsJournal of the Operational Research Society, 1996
- An introduction to timetablingEuropean Journal of Operational Research, 1985