4.2 Article

Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm

期刊

INFORMATION PROCESSING LETTERS
卷 102, 期 1, 页码 8-16

出版社

ELSEVIER
DOI: 10.1016/j.ipl.2006.10.005

关键词

particle swarm optimization; analysis of algorithms; stochastic convergence analysis; stochastic optimization; parameter selection

向作者/读者索取更多资源

This letter presents a formal stochastic convergence analysis of the standard particle swarm optimization (PSO) algorithm, which involves with randomness. By regarding each particle's position on each evolutionary step as a stochastic vector, the standard PSO algorithm determined by non-negative real parameter tuple {omega, c(1), c(2)) is analyzed using stochastic process theory. The stochastic convergent condition of the particle swarm system and corresponding parameter selection guidelines are derived. (c) 2006 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据