Niching particle swarm optimization with local search for multi-modal optimization

详细信息	查看全文 | 推荐本文 |

• 作者：B.Y. Qu^a ; ^b ; ^{E070088@ntu.du.sg} ; J.J. Liang^a ; ^{liangjing@zzu.ed.cn} ; P.N. Suganthan^b ; ^{epnsugan@ntu.edu.sg}
• 关键词：Evolutionary computation ; Niching ; Multi-modal evolutionary optimization algorithm ; Particle swarm optimization ; Local search
• 刊名：Information Sciences
• 出版年：2012
• 期刊代码：62_00200255
• 类别：cp
• 出版时间：15 August, 2012
• 卷：197
• 期：Complete
• 页码：131-143
• 文件大小：724 K

摘要

Multimodal optimization is still one of the most challenging tasks for evolutionary computation. In recent years, many evolutionary multi-modal optimization algorithms have been developed. All these algorithms must tackle two issues in order to successfully solve a multi-modal problem: how to identify multiple global/local optima and how to maintain the identified optima till the end of the search. For most of the multi-modal optimization algorithms, the fine-local search capabilities are not effective. If the required accuracy is high, these algorithms fail to find the desired optima even after converging near them. To overcome this problem, this paper integrates a novel local search technique with some existing PSO based multimodal optimization algorithms to enhance their local search ability. The algorithms are tested on 14 commonly used multi-modal optimization problems and the experimental results suggest that the proposed technique not only increases the probability of finding both global and local optima but also reduces the average number of function evaluations.