.png){kind=icon}
Return
Self-adaptive harmony search algorithm for optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2009.09.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, a new meta-heuristic optimization algorithm - harmony search (HS) with continuous design variables was developed. This algorithm is conceptualized using the musical improvisation process of searching for a perfect state of harmony. Although several variants and an increasing number of applications have appeared, one of its main difficulties is how to select suitable parameter values. In this paper, we used the consciousness (i.e., harmony memory) to automatically adjust parameter values. In addition, the pseudo-random number generator is also replaced by the low-discrepancy sequences for initialization of the harmony memory. Finally, the experimental results revealed the superiority of the proposed method to the original HS and recently developed variants. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Harmony search
Low-discrepancy sequence
Meta-heuristic algorithm
Optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
No cited papers available