Hyper-heuristics

Peter Ross (p.ross@napier.ac.uk)
Additional contact information
Peter Ross: Edinburgh Napier University

Chapter Chapter 20 in Search Methodologies, 2014, pp 611-638 from Springer

Abstract: Abstract Many practical problems are awkward to solve computationally. Whether you are trying to find any solution at all, or perhaps to find a solution that is optimal or close to optimal according to some criteria, exact methods can be unfeasibly expensive. In such cases it is common to resort to heuristic methods, which are typically derived from experience but are inexact or incomplete. For example, in packing and cutting problems a very simple heuristic might be to try to pack the items in some standardized way starting with the largest remaining one first, on the reasonable grounds that the big ones tend to cause the most trouble. But such heuristics can easily lead to suboptimal answers.

Keywords: Suboptimal Answer; Hyper-heuristic Method; HyFlex; Candidate Heuristics; Off-line Problem (search for similar items in EconPapers)
Date: 2014
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-1-4614-6940-7_20

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

DOI: 10.1007/978-1-4614-6940-7_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).