Citation
Evolving Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 447-457, 2009.
Paper
Abstract
This paper presents a genetic programming (GP) hyper-heuristic approach that optimizes a search space of functions to assess the difficulty of allocating an examination during the timetable construction process. Each function is a heuristic combination of lowlevel construction heuristics combined by logical operators. The approach is tested on a set of five benchmark problems of varying difficulty to evaluate its ability to generalize. The GP hyper-heuristic approach was found to generalize well over the five problems and performed comparably to other hyper-heuristic approaches combining low-level construction heuristics.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-447-457-P, author = {N. Pillay},
title = {Evolving Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {447--457},
note = {Paper},
abstract = {This paper presents a genetic programming (GP) hyper-heuristic approach that optimizes a search space of functions to assess the difficulty of allocating an examination during the timetable construction process. Each function is a heuristic combination of lowlevel construction heuristics combined by logical operators. The approach is tested on a set of five benchmark problems of varying difficulty to evaluate its ability to generalize. The GP hyper-heuristic approach was found to generalize well over the five problems and performed comparably to other hyper-heuristic approaches combining low-level construction heuristics.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-447-457-P.pdf} }