Hyper-Heuristics

Peter Ross
Additional contact information
Peter Ross: Napier University, School of Computing

Chapter Chapter 17 in Search Methodologies, 2005, pp 529-556 from Springer

Abstract: Abstract 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.

Keywords: Genetic Algorithm; Local Search; Variable Neighborhood Search; Timetabling Problem; Party Size (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-28356-2_17

Ordering information: This item can be ordered from
http://www.springer.com/9780387283562

DOI: 10.1007/0-387-28356-0_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().