Harmony Search as a Metaheuristic Algorithm

By Xin-She Yang. 2010

556 citations recorded by the source corpus.

This first chapter intends to review and analyze the powerful new Harmony Search (HS) algorithm in the context of metaheuristic algorithms. We will first outline the fundamental steps of HS, and show how it works. We then try to identify the characteristics of metaheuristics and analyze why HS is a good metaheuristic algorithm. We then review briefly other popular metaheuristics such as particle swarm optimization so as to find their similarities and differences with HS. Finally, we will discuss the ways to improve and develop new variants of HS, and make suggestions for further research including open questions.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/ad426f6d07a62302ac954ae49f87767a3a9b881c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Xin-She Yang
  2. Tansel Dökeroğlu
  3. Amir H. Gandomi
  4. Seyedali Mirjalili
  5. Arpan Kumar Kar
  6. Ahmet Cosar
  7. Tayfun Kucukyilmaz
  8. Ender Sevinç

In Computational Theory and Mathematics

  1. Xin-She Yang
  2. Amir H. Gandomi
  3. Tansel Dökeroğlu
  4. Suash Deb
  5. Arpan Kumar Kar
  6. Ahmet Cosar
  7. Tayfun Kucukyilmaz
  8. Ender Sevinç

In Industrial and Manufacturing Engineering

  1. Amir H. Gandomi
  2. Suash Deb
  3. Xin-She Yang
  4. Amir Hossein Alavi
  5. Tansel Dökeroğlu
  6. Abdolreza Hatamlou
  7. Ahmet Cosar
  8. Tayfun Kucukyilmaz

Citations in the corpus