基于变惯性权重及动态邻域的改进PSO算法  

Improved PSO Algorithm Based on Variety Inertia Weight and Dynamic Neighborhood

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

机构地区：[1]华南理工大学经济与贸易学院,广州510006 [2]华南理工大学工商管理学院,广州510640

出　　处：《计算机工程》2011年第21期20-22,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(71173076;71103044);教育部人文社会科学研究青年基金资助项目(11YJCZH211;08JC790023);中央高校基本科研业务费专项基金资助项目(2011ZB0011);广东省哲学社会科学"十一五"规划基金资助项目(07GO02)

摘　　要：分析并验证基于变惯性权重的粒子群优化(PSO)在粒子寻优过程中的有效性,论述类无标度网的特殊拓扑性质。将有向动态类无标度网作为粒子寻优邻域,提出一种基于变惯性权重及动态邻域的改进PSO算法。实验结果证明,与传统PSO算法相比,改进算法的寻优效果较好,可在一定程度上避免陷入局部最优。This paper analyzes and verifies the effectiveness of Particle Swarm Optimization（PSO） based on variety inertia weight in the particle optimization process,and discusses the special topological properties of scale-free like network.It uses the dynamic scale-free like network as the particle’s optimization neighborhood.It proposes an improved PSO algorithm based on variety inertia weight and dynamic neighborhood.Experimental results show that the improved algorithm performs better than the traditional PSO and may avoid falling into the local optimum instead.

关 键 词：粒子群优化 类无标度网 惯性权重 度分布 邻域拓扑 

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