.png){kind=icon}
Return
A self-adaptive global best harmony search algorithm for continuous optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.01.088.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information captured in the current global best solution can be well utilized to generate new harmonies. The harmony memory consideration rate (HMCR) and pitch adjustment rate (PAR) are dynamically adapted by the learning mechanisms proposed. The distance bandwidth (BW) is dynamically adjusted to favor exploration in the early stages and exploitation during the final stages of the search process. Extensive computational simulations and comparisons are carried out by employing a set of 16 benchmark problems from literature. The computational results show that the proposed SGHS algorithm is more effective in finding better solutions than the state-of-the-art harmony search (HS) variants. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Harmony search
Evolutionary algorithms
Meta-heuristics
Continuous optimization
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave View more