|Appears in Collections:
|Computing Science and Mathematics Book Chapters and Sections
|Exploring hyper-heuristic methodologies with genetic programming
|Burke E, Hyde M, Kendall G, Ochoa G, Ozcan E & Woodward J (2009) Exploring hyper-heuristic methodologies with genetic programming. In: Mumford C & Jain L (eds.) Computational Intelligence: Collaboration, Fusion and Emergence. Intelligent Systems Reference Library, 1, Volume 1. Berlin and Heidelberg: Springer, pp. 177-201. http://www.springerlink.com/content/j11565558t12900u/
|Genetic programming (Computer science)
|Intelligent Systems Reference Library, 1, Volume 1
|Hyper-heuristics represent a novel search methodology that is motivated by the goal of automating the process of selecting or combining simpler heuristics in order to solve hard computational search problems. An extension of the original hyper-heuristic idea is to generate new heuristics which are not currently known. These approaches operate on a search space of heuristics rather than directly on a search space of solutions to the underlying problem which is the case with most meta-heuristics implementations. In the majority of hyper-heuristic studies so far, a framework is provided with a set of human designed heuristics, taken from the literature, and with good measures of performance in practice. A less well studied approach aims to generate new heuristics from a set of potential heuristic components. The purpose of this chapter is to discuss this class of hyper-heuristics, in which Genetic Programming is the most widely used methodology. A detailed discussion is presented including the steps needed to apply this technique, some representative case studies, a literature review of related work, and a discussion of relevant issues. Our aim is to convey the exciting potential of this innovative approach for automating the heuristic design process.
|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.
|Fulltext - Published Version
|Under Embargo until 3000-12-01 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 dependent 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.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.