计算机工程与应用2016，Vol.52Issue(7)：50-55,149,7.DOI:10.3778/j.issn.1002-8331.1409-0178
自适应变异粒子群算法
Particle Swarm Optimization based on self-adaptive mutation
摘要
Abstract
In order to deal with the problems that the diversity of particle swarm is low and it is easy for particle swarm to fall in local optimum solution, this paper proposes a novel Particle Swarm Optimization (PSO) algorithm based on self-adaptive mutation, which combines with the optimal and other particles’different role in the population. In the pro-posed algorithm, according to the evolution degree, the optimal particle can adaptively adjust its adjacent search domain size so as to strengthen the local search capacity and for the non-optimal particles, their locations can initialize randomly in low probability in order to increase the diversity of particle swarm and enhance the global search capacity when its speed is zero. In simulation, the algorithm is applied to the optimization problems of six typical complex functions, and comparing its performance with the other mutation PSO algorithms. The simulation results show that the proposed algo-rithm not only enhances population diversity, but also strengthens the local search capacity.关键词
粒子群算法/局部收敛/自适应/变异操作/群体智能Key words
Particle Swarm Optimization(PSO)/local convergence/self-adaptive/mutation/swarm intelligence分类
信息技术与安全科学引用本文复制引用
周利军,彭卫,邹芳,刘宇荧,李莉..自适应变异粒子群算法[J].计算机工程与应用,2016,52(7):50-55,149,7.基金项目
四川省教育厅资助项目（No.13ZB0287）。 （）
