Problem difficulty analysis for particle swarm optimization: Deception and modality

Bin Xin*, Jie Chen, Feng Pan

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

22 引用 (Scopus)

摘要

This paper studies the problem difficulty for a popular optimization method - particle swarm optimization (PSO), particularly for the PSO variant PSO-cf (PSO with constriction factor), and analyzes its predictive measures. Some previous measures and related issues about other optimizers, mainly including deception and modality, are checked for PSO. It is observed that deception is mainly the combination of three factors - the measure ratios of attraction basins, the relative distance of attractors and the relative difference of attractors' altitudes. Multimodality and multi-funnel are proved not to be the essential factors contributing to the problem difficulty for PSO. The counterexamples and comparative experiments in this paper can be taken as a reference for further researches on novel comprehensive predictive measures of problem difficulty for PSO.

源语言英语
主期刊名2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09
623-630
页数8
DOI
出版状态已出版 - 2009
活动2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09 - Shanghai, 中国
期限: 12 6月 200914 6月 2009

出版系列

姓名2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

会议

会议2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09
国家/地区中国
Shanghai
时期12/06/0914/06/09

指纹

探究 'Problem difficulty analysis for particle swarm optimization: Deception and modality' 的科研主题。它们共同构成独一无二的指纹。

引用此