|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||Analyzing the landscape of a graph based hyper-heuristic for timetabling problems|
|Citation:||Ochoa G, Qu R & Burke E (2009) Analyzing the landscape of a graph based hyper-heuristic for timetabling problems Proceeding GECCO '09 Proceedings of the 11th Annual conference on Genetic and evolutionary computation , 11th Annual Genetic and Evolutionary Computation Conference (GECCO-2009), Montréal, Canada, 8.7.2009 - 12.7.2009, New York, NY: ACM, pp. 341-348.|
|Conference Name:||11th Annual Genetic and Evolutionary Computation Conference (GECCO-2009)|
|Conference Location:||Montréal, Canada|
|Abstract:||Hyper-heuristics can be thought of as "heuristics to choose heuristics". They are concerned with adaptively finding solution methods, rather than directly producing a solution for the particular problem at hand. Hence, an important feature of hyper-heuristics is that they operate on a search space of heuristics rather than directly on a search space of problem solutions. A motivating aim is to build systems which are fundamentally more generic than is possible today. Understanding the structure of these heuristic search spaces is therefore, a research direction worth exploring. In this paper, we use the notion of fitness landscapes in the context of constructive hyper-heuristics. We conduct a landscape analysis on a heuristic search space conformed by sequences of graph coloring heuristics for timetabling. Our study reveals that these landscapes have a high level of neutrality and positional bias. Furthermore, although rugged, they have the encouraging feature of a globally convex or big valley structure, which indicates that an optimal solution would not be isolated but surrounded by many local minima. We suggest that using search methodologies that explicitly exploit these features may enhance the performance of constructive hyper-heuristics.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Affiliation:||Computing Science - CSM Dept|
University of Nottingham
Deputy Principal's Office
|Analyzing the landscape of a graph based hyper-heuristic for timetabling problems.pdf||1.63 MB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.