.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Harmony search
Evolutionary algorithms
Meta-heuristics
Continuous optimization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容