Harmony Search Algorithms for binary optimization problems

Miriam Padberg ()
Additional contact information
Miriam Padberg: TU

A chapter in Operations Research Proceedings 2011, 2012, pp 343-348 from Springer

Abstract: Abstract In many theoretical and empirical investigations heuristic methods are the subject of investigation for optimization problems in order to get good and valid solutions. In 2001 Harmony Search, a new music-inspired meta-heuristic, was introduced [1]. It has been applied to various types of optimization problems, for example structural design problems, showing significant improvements over other heuristics. Motivated by the question whether these heuristics represent a new class of meta-heuristics or whether they are only another representation of a well-known technique, a couple of investigations were made. In this paper we will show that for the class of binary optimization problems this new nature-inspired heuristic is ”equivalent” to an evolutionary algorithm.

Keywords: Evolutionary Algorithm; Random Selection; Solution Vector; Pitch Adjustment; Memory Consideration (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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:oprchp:978-3-642-29210-1_55

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

DOI: 10.1007/978-3-642-29210-1_55

Access Statistics for this chapter

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