|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Special issue on hyper-heuristics in search and optimization|
|Citation:||Ochoa G & Ozcan E (2010) Special issue on hyper-heuristics in search and optimization, Journal of Heuristics, 16 (6), pp. 745-748.|
|Abstract:||First paragraph: A hyper-heuristic is an automated methodology for selecting or generating heuristics to solve hard computational search problems. The main feature distinguishing these methods is that they explore a search space of heuristics (rather than a search space of potential solutions to a problem). The goal is that hyper-heuristics will lead to more general systems that are able to automatically operate over a wider range of problem domains than is possible today. The term hyper-heuristic was first used in 1997 to describe a protocol that combines several artificial intelligence methods in the context of automated theorem proving. The term was independently used in 2000 to describe 'heuristics to choose heuristics' in the context of combinatorial optimization. The idea of automating the design of heuristics, however, can be traced back to the early 60s. A more recent research trend in hyper-heuristics attempts to automatically generate new heuristics suited to a given problem or class of problems. This is typically done by combining, through the use of genetic programming for example, components or building-blocks of human designed 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.|
|Ochoa and Ozcan.pdf||151.59 kB||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 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.
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.