连续型粒子群优化算法的均方收敛性分析

摘要

粒子群优化算法是基于生物群体内个体间的合作与竞争等复杂行为产生的群体智能优化算法,已有的理论分析多在确定性的情况下进行算法收敛性分析.本文基于随机系统的矩方程法分析了连续型粒子群优化算法的均方收敛性,并给出了能够保证算法均方收敛域,最后通过仿真实验分析验证了相关结论.%Particle swarm optimization (PSO) algorithm is a population-based, self-adaptive search optimization method motivated by the observation of simplified animal social behaviors. Most of the analysis of PSO algorithm is in the deterministic assumptions . Based on the theory of stochastic process, this paper studies the mean square convergence of the particle swarm optimization algorithm. Simulations demonstrate the validity of the proposed method.