一种变异的改进粒子群优化算法  

An Optimization Algorithm of Mutant and Improved Particle Swarm

作　　者：陈永刚[1] 邱涌[1] 肖春宝[1] 

机构地区：[1]河南科技大学电子信息工程学院,河南洛阳471003

出　　处：《电脑与电信》2012年第6期34-35,共2页Computer & Telecommunication

摘　　要：为了解决粒子群优化算法容易陷入局部最优和后期搜索精度不高的问题,提出了带有合作算子的改进粒子群算法。合作算子和粒子运动公式的动态调整改善种群的多样性并且提高了搜索精度。从算法的收敛性、准确性和稳定性等方面对这种改进算法进行分析和实验,发现均优于标准粒子群优化(PSO)算法。To avoid the problem of premature convergence and poor accuracy in later period, an improved particle swarm optimization （IPSO） algorithm with cooperation operator is introduced. Cooperation operator and dynamic adjustment of particle movement formula improve the diversity of the population and algorithm accuracy. Its convergence, accuracy, and stability with two benchmark function are test. It is found that IPSO outperforms the normal PSO algorithm clearly.

关 键 词：粒子群算法 合作算子 群智能 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]