Metaheuristics in General

Günther Zäpfel (), Roland Braune () and Michael Bögl ()
Additional contact information
Günther Zäpfel: Universität Linz
Roland Braune: Universität Linz
Michael Bögl: Universität Linz

Chapter Chapter 4 in Metaheuristic Search Concepts, 2010, pp 67-73 from Springer

Abstract: Abstract In Chapter 3, we pointed out different ways of conducting a heuristic search within a solution space based on the knapsack problem. We also pointed out that the basic principles of search heuristics which we identified, are generic, meaning that they can be applied to a whole variety of different optimization problems. Likewise, we can consider the strategies which build upon the basic principles as problem-independent. The actual realization of the basic principle itself, however, is a problem-specific issue, since it has to be defined how a solution may be constructed, modified or recombined. Figure 4.1 gives an illustration of these interrelationships.

Keywords: Knapsack Problem; Metaheuristic Algorithm; Heuristic Search Method; Algorithmic Skeleton; Simple Local Search (search for similar items in EconPapers)
Date: 2010
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-3-642-11343-7_4

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

DOI: 10.1007/978-3-642-11343-7_4

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 ().