RONG QU rong.qu@nottingham.ac.uk
Professor of Computer Science
Hybridizations within a graph based hyper-heuristic framework for university timetabling problems
Qu, Rong; Burke, Edmund
Authors
Edmund Burke
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 discussed.
Citation
Qu, R., & Burke, E. (2008). Hybridizations within a graph based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society, 60(9), https://doi.org/10.1057/jors.2008.102
Journal Article Type | Article |
---|---|
Publication Date | Oct 22, 2008 |
Deposit Date | Feb 18, 2015 |
Publicly Available Date | Feb 18, 2015 |
Journal | Journal of the Operational Research Society |
Print ISSN | 0160-5682 |
Electronic ISSN | 1476-9360 |
Publisher | Taylor and Francis |
Peer Reviewed | Peer Reviewed |
Volume | 60 |
Issue | 9 |
DOI | https://doi.org/10.1057/jors.2008.102 |
Keywords | University timetabling, Graph colouring heuristics, Hyper-heuristics, Tabu Search, Variable Neighbourhood Search, Iterated Local Search |
Public URL | https://nottingham-repository.worktribe.com/output/705119 |
Publisher URL | http://www.palgrave-journals.com/jors/journal/v60/n9/abs/jors2008102a.html |
Additional Information | This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version: Qu, R. & Burke, E.K., Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society, 60(9), (2009), 1273–1285 is available online at: http://www.palgrave-ournals.com/jors/journal/v60/n9/abs/jors2008102a.html |
Files
JORS08.pdf
(199 Kb)
PDF
You might also like
A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem
(2024)
Journal Article
Self-Bidirectional Decoupled Distillation for Time Series Classification
(2024)
Journal Article
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search