.png){kind=icon}
Return
Harmony search algorithm with dynamic control parameters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2012.06.048.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Harmony search (HS) is a population-based meta-heuristic imitating the music improvisation process, which has been successfully applied to optimization problems in recent years. This paper presents an effective harmony search algorithm for solving global continuous optimization problems. The proposed method presents a novel improvisation process which is different from the classical HS in two aspects. Firstly, the candidate harmony is chosen from the harmony memory by a tournament selection rule, so that the harmonies with better fitness will have more opportunities to be used in generating new harmonies. Secondly, two key control parameters, pitch adjustment rate (PAR) and bandwidth distance (bw), are adjusted dynamically with respect to the evolution of the search process and the different search spaces of the optimization problems. Numerical results demonstrate that the proposed algorithm performs much better than the existing HS variants in terms of the solution quality and the stability. (C) 2012 Elsevier Inc. All rights reserved.
Keywords:
Harmony search
Continuous optimization
Meta-heuristics
Evolutionary algorithms
Dynamic parameter
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more