Search Heuristics

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 3 in Metaheuristic Search Concepts, 2010, pp 31-64 from Springer

Abstract: Abstract In the summary of Chapter 2, we have indicated that it would be desirable to apply heuristic methods which perform better than simple intuitive ones. As for the knapsack problem, we already identified two heuristic ways of obtaining a fairly good solution. The principle behind, however, remained the same in both versions: We constructed one single solution by successively adding solution components (items) according to certain priorities. Of course, this principle is generalizable and thus not limited to the knapsack problem. Therefore we will refer to such methods as “constructive heuristics” in the course of this book.

Keywords: Search Process; Solution Quality; Knapsack Problem; Candidate List; Memory Structure (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_3

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

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

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