改进的粒子群优化算法的研究和分析  

Study and analysis of improved Particle Swarm Optimization algorithm

作　　者：田东平[1,2] 徐成虎[3] 

机构地区：[1]宝鸡文理学院计算机软件研究所,陕西宝鸡721007 [2]宝鸡文理学院计算机科学系,陕西宝鸡721007 [3]宝鸡文理学院教育科学系,陕西宝鸡7210071

出　　处：《计算机工程与应用》2008年第34期56-60,共5页Computer Engineering and Applications

摘　　要：粒子群优化算法是一种新的随机全局优化进化算法。为了有效地控制其全局搜索和局部搜索,使之获得较好的平衡,论文在深入分析和研究标准粒子群优化算法的基础上,提出了一种基于进化代数阈值和粒子间最大聚集距离高斯变异的粒子群优化算法。该算法在运行过程中通过粒子聚集程度的量化判定,对当前的最优粒子施加高斯变异,从而增强粒子群优化算法跳出局部最优解的能力。测试函数仿真结果表明了该算法的可行性和有效性。Particle Swarm Optimization （PSO） is a novel stochastic global optimization evolutionary algorithm.To efficiently control the global search and local search of PSO and obtain a better balance between them.In this paper,a new particle swarm optimization is proposed based on the threshold of evolutionary generation,maximal focusing distance and Gaussian mutation among particles.The new algorithm includes Gaussian mutation operator during the running time,which,through the quantization decision of particles focusing degrees,can be very useful to improve the ability of PSO in breaking away from the local optimum.The experimental results show that the proposed algorithm is feasible and effective.

关 键 词：粒子群优化算法 全局搜索 局部搜索 最大聚集距离 高斯变异 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]