The term hyper-heuristics is fairly new, although the notion has been hinted at in papers from time to time since the 1960s (e.g. Crowston et al., 1963). The key idea is to devise new algorithms for solving problems by combining known heuristics in ways that allow each to compensate, to some extent, for the weaknesses of others. They might be thought of as heuristics to choose heuristics. They are methods which work with a search space of heuristics. In this sense, they differ from most applications of metaheuristics (see Glover and Kochenberger, 2003) which usually work with search spaces of solutions. One of the main goals of research in this area is to devise algorithms that are fast and exhibit good performance across a whole family of problems, presumably because the algorithms address some shared features of the whole set of problems. © 2005 Springer Science+Business Media, LLC.
CITATION STYLE
Ross, P. (2005). Hyper-heuristics. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (pp. 529–556). Springer US. https://doi.org/10.1007/0-387-28356-0_17
Mendeley helps you to discover research relevant for your work.