一种基于有向动态网络拓扑的粒子群优化算法  

Improved PSO algorithm with dynamic directed network topology

作　　者：姚灿中[1] 杨建梅[1] 

机构地区：[1]华南理工大学工商管理学院,广州510640

出　　处：《计算机工程与应用》2009年第27期15-17,49,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.70773041~~

摘　　要：该文提出了一种改进的PSO算法PSO-DSF。引进有向类无标度网作为粒子群寻优的拓扑结构,提出作为粒子邻域拓扑的有向网络动态变化机制,使有向网络在出度服从幂律分布的条件下动态变化,从而提高算法的多样性,避免过早陷入局部最优的情况。通过函数测试,证实了该改进方案的有效性。A new approach is suggested to improve PSO’s performance called algorithm PSODSF.The dynamic ScaleFree like network is brought as the neighborhood topology structures and the mechanism of the dynamic directed network is designed.As the network evolves with the mechanism,the out degrees of the network follow the power-law distribution and the diversity of the algorithm is improved.The algorithm is identified that perform well when it is near optima positions.Four benchmark functions are selected as the tested functions.The experimental results illustrate the advantage of PSODSF.

关 键 词：粒子群优化算法 有向网络 类无标度网 

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