.png){kind=icon}
返回
Global Dynamic Harmony Search algorithm: GDHS
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.11.058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new modification of Harmony Search (HS) algorithm to improve its accuracy and convergence speed and eliminates setting parameters that have to be defined before optimization process and it is difficult to predict fixed values for all kinds of problems. The proposed algorithm is named Global Dynamic Harmony Search (GDHS). In this modification, all the key parameters are changed to dynamic mode and there is no need to predefine any parameters; also the domain is changed to dynamic mode to help a faster convergence. Two experiments, with large sets of benchmark functions, are executed to compare the proposed algorithms with other ones. In the first experiment, 15 benchmark problems are used to compare the proposed algorithm with other similar algorithms based on the Harmony Search method and in the second experiment, 47 benchmark problems are used to compare the performance of the GDHS with other algorithms from different families, including: GA, PSO, DE and ABC algorithms. Results showed that the proposed algorithm outperforms the other algorithms, considering the point that the GDHS does not require any predefined parameter. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Harmony Search algorithm
Dynamic Harmony Search
Meta-heuristics
Evolutionary algorithms
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踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
PREAI
分享收藏Learnable Evolution ModeL: Evolutionary processes guided by machine learning.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容