一种改进的微粒群算法  

Modified particle swarm optimization algorithm

作　　者：王胥鹏[1] 胡劲松[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510006

出　　处：《计算机应用研究》2009年第10期3642-3644,3648,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60574078);广东省自然科学基金资助项目(31454);广州市科技计划应用基础研究项目(2006J1-C0321)

摘　　要：通过在微粒群算法中引入排雷策略的思想,对微粒群优化算法进行改进,使微粒群算法能摆脱局部极值点的束缚;另外通过在算法的迭代过程中加入旋转方向法,加快算法的收敛速度,从而形成一种新的改进粒子群算法。通过对三个典型函数进行优化计算,并与其他文献的改进微粒群算法的优化结果进行比较,表明基于排雷策略的改进算法很好地解决了粒子群优化算法早收敛、难以跳出局部极值点和收敛较慢的问题。To deal with the problem of premature convergence and slow search speed, this paper proposed a new particle swarm optimization （PSO）. The new method was based on clearing of mines, which was guaranteed to converge to the global optimization solution with probability one. In addition, combined the new method with rotating direction method, which was beneficial for the convergence speed. Through the calculation of three typical function, and made comparison with other improvement particle swarm optimization algorithm, they show that the new method which solves the problem of premature convergence and slow search speed.

关 键 词：微粒群优化算法 排雷策略 旋转方向法 收敛 

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