返回
Novel global harmony search algorithm for unconstrained problems
DOI:10.1016/j.neucom.2010.07.010.png)
摘要
En 中文
In this paper, we use a recently proposed algorithm-novel global harmony search (NGHS) algorithm to solve unconstrained problems. The NGHS algorithm includes two important operations: position updating and genetic mutation with a low probability. The former can enhance the convergence of the NGHS, and the latter can effectively prevent the NGHS from being trapped into the local optimum. Based on a large number of experiments, the NGHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its two improved algorithms (IHS and SGHS). (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Novel global harmony search algorithm
Position updating
Genetic mutation
Convergence
Stability
Harmony search algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
The Effect of Electron Irradiation on the Structure of Sodium Aluminum-Iron Phosphate Glasses电子辐照对磷酸铝铁钠玻璃结构的影响
MRS Advances
IF0

