Hyper-heuristics

21Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Ross, P. (2014). Hyper-heuristics. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Second Edition (pp. 611–638). Springer US. https://doi.org/10.1007/978-1-4614-6940-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free