book chapter · Intelligent Systems · 2018

Harmony Search Algorithm

Cited by 12Abstract and details only

Abstract

Harmony search (HS) is a meta-heuristic search algorithm which tries to mimic the improvisation process of musicians in finding a pleasing harmony. In recent years, due to some advantages, HS has received a significant attention. HS is easy to implement, converges quickly to the optimal solution and finds a good enough solution in a reasonable amount of computational time. The merits of HS algorithm have led to its application to optimization problems of different engineering areas. In this chapter, the concepts and performance of HS algorithm are shown and some engineering applications are reviewed. It is observed that HS has shown promising performance in solving difficult optimization problems and different versions of this algorithm have been developed. In the next years, it is expected that HS is applied to more real optimization problems.

Cite this paper

APA 7

Askarzadeh, A., & Rashedi, E. (2018). Harmony Search Algorithm. Intelligent Systems, 1–30. https://doi.org/10.4018/978-1-5225-5643-5.ch001

MLA 9

Askarzadeh, Alireza, and Esmat Rashedi. “Harmony Search Algorithm.” Intelligent Systems, 2018, pp. 1–30, https://doi.org/10.4018/978-1-5225-5643-5.ch001.

Chicago

Askarzadeh, Alireza, and Esmat Rashedi. 2018. “Harmony Search Algorithm.” Intelligent Systems: 1–30. https://doi.org/10.4018/978-1-5225-5643-5.ch001.

Harvard

Askarzadeh, A. and Rashedi, E. (2018) ‘Harmony Search Algorithm’, Intelligent Systems, pp. 1–30. Available at: https://doi.org/10.4018/978-1-5225-5643-5.ch001.

BibTeX

@incollection{askarzadeh2018harmony,
  title = {{Harmony Search Algorithm}},
  author = {Askarzadeh, Alireza and Rashedi, Esmat},
  booktitle = {Intelligent Systems},
  pages = {1--30},
  year = {2018},
  doi = {10.4018/978-1-5225-5643-5.ch001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.