A survey on applications of the harmony search algorithm
- Authors
- Manjarres, D.; Landa-Torres, I.; Gil-Lopez, S.; Del Ser, J.; Bilbao, M. N.; Salcedo-Sanz, S.; Geem, Z. W.
- Issue Date
- Sep-2013
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Keywords
- Harmony search algorithm; State of the art; Applications
- Citation
- ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, v.26, no.8, pp.1818 - 1831
- Journal Title
- ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Volume
- 26
- Number
- 8
- Start Page
- 1818
- End Page
- 1831
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/14322
- DOI
- 10.1016/j.engappai.2013.05.008
- ISSN
- 0952-1976
- Abstract
- This paper thoroughly reviews and analyzes the main characteristics and application portfolio of the so-called Harmony Search algorithm, a meta-heuristic approach that has been shown to achieve excellent results in a wide range of optimization problems. As evidenced by a number of studies, this algorithm features several innovative aspects in its operational procedure that foster its utilization in diverse fields such as construction, engineering, robotics, telecommunications, health and energy. This manuscript will go through the most recent literature on the application of Harmony Search to the aforementioned disciplines towards a three-fold goal: (1) to underline the good behavior of this modern meta-heuristic based on the upsurge of related contributions reported to date; (2) to set a bibliographic basis for future research trends focused on its applicability to other areas; (3) to provide an insightful analysis of future research lines gravitating on this meta-heuristic solver. (C) 2013 Elsevier Ltd. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 에너지IT학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/14322)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.