基于群体适应度方差的自适应粒子群优化算法  

Adaptive particle swarm optimization based on colony fitness variance

作　　者：田东平[1,2] 赵天绪[2] 

机构地区：[1]宝鸡文理学院计算机软件研究所,陕西宝鸡721007 [2]宝鸡文理学院计算信息科学研究所,陕西宝鸡721007

出　　处：《计算机工程与应用》2010年第18期24-26,39,共4页Computer Engineering and Applications

基　　金：陕西省科技厅自然科学基础研究项目(No.SJ08-ZT13);陕西省教育厅科研计划项目No.09JK335~~

摘　　要：针对基本粒子群优化算法稳定性较差和易陷入局部收敛的缺点,提出了一种基于群体适应度方差的自适应粒子群优化算法。一方面,在可行域中采用混沌初始化生成均匀分布的粒群,提高了初始解的质量;另一方面,构造了基于群体适应度方差的惯性权重的自适应变换公式,增强了算法跳出局部最优解的能力。仿真实验结果表明了该算法的可行性和有效性。Particle Swarm Optimization（PSO） is a novel stochastic global optimization evolutionary algorithm.To overcome the poor stability and local convergence of PSO,an adaptive particle swarm optimization based on colony fitness variance（FV-APSO） is proposed.On the one hand,the uniformly distributed particles are generated in the feasible region by chaos so as to improve the quality of the initial solutions.On the other hand,the adaptive transformation formula of the inertia weight,which is based on fitness variance of swarm is constructed in order to enhance the ability of the PSO to get away from the local optimum.Simulation results show that the FV-APSO is feasible and effective.

关 键 词：粒子群优化 稳定性 局部收敛 惯性权重 

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