期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2013
卷号：6
期号：6
页码：117-128
出版社：SERSC
摘要：Particle swarm optimization (PSO) is a population-based stochastic optimization originat- ing from artificial life and evolutionary computation. PSO is motivated by the social behavior of organisms, such as bird flocking, fish schooling and human social relations. Its properties of low constraint on the continuity of objective function and ability of adapting to the dynamic environment make PSO become one of the most important swarm intelligence algorithms. However, compared to the various version of modified PSO and the corresponding applica- tions in many domains, there has been very little research on the PSO's convergence analysis. So the current paper, to begin with, elaborates the basic principles of standard PSO. Then the existing work on the convergence analyses of PSO in the literatures is thoroughly surveyed, which plays an important role in establishing the solid theoretical foundation for PSO algorithm. In the end, some important conclusions and possible research directions of PSO that need to be studied in the future are proposed
