改进后的轮换步长PSO算法  

Improved Rotation Step PSO Algorithm

作　　者：赵晓寒 张丰[1] 曹琦 冯佳 ZHAO Xiao-han;ZHANG Feng;CAO Qi;FENG Jia(Suihua University,College of Electrical Engineering,Suihua Heilongjiang 152061,China)

机构地区：[1]绥化学院电气工程学院,黑龙江绥化152061

出　　处：《通信技术》2018年第4期805-808,共4页Communications Technology

基　　金：绥化学院科学技术研究项目(No.K201702001)~~

摘　　要：轮换步长PSO算法是针对PSO算法的早熟问题提出的一种新型PSO优化方法。此算法在粒子之间加入排斥力,把即将陷入早熟的粒子分开,使得各个粒子无法聚集在同一点上,从而使整个粒子群不会发生全部粒子收敛于局部最优解的现象,以提高算法的抗早熟性。轮换步长PSO算法虽具有很好的抗早熟性,但其步长在方向上不具有随机性,而烟花算法在方向上具有很好的随机性。因此,将轮换步长PSO算法和烟花算法相结合,大大改善了轮换步长PSO算法在步长方向的随机性。Aiming at resolving the premature problem of PSO,a new optimization method was proposed,which is called rotation step PSO algorithm.This algorithm adds repelling forces between particles to avoid them gathering at the same point.Consequently,it is impossible for the entire particle swarm to converge in local optimal solution.Thus,the anti-precocity character of PSO is improved.Although the rotation step PSO is good at the anti-precocity aspect,its step is not random in direction.On the contrary,fireworks algorithm has fine randomness in direction.In this paper,rotation step PSO and fireworks algorithm is combined,so the randomness of the former is effectively improved.

关 键 词：轮换步长PSO算法 斥力 烟花算法 爆炸算子 

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