基于剪枝策略的骨干粒子群算法.pdf

第30 卷 第9 期 控 制 与 决 策 2015 年 9 月 Vol. 30 No. 9 Control and Decision Sep. 2015 文章编号: 1001-0920 (2015) 09-1591-06 DOI: 10.13195/j.kzyjc.2014.0905 基于剪枝策略的骨干粒子群算法 张 震, 潘再平, 潘晓弘 (浙江大学工学部，杭州310000) 摘 要: 为了优化算法的全局探索能力和局部开发能力, 提出一种基于两方面改进的骨干粒子群算法. 提出一种进 化方程, 通过即时搜索域的分析说明该方程可以改善粒子多样性. 提出粒子群“剪枝”策略: 每当粒子搜索到新的群 体最优位置时, 剪去该粒子, 同时初始化一个新位置以安插该粒子. 理论分析指出, 在增强全局探索能力的同时, 合适 的剪枝策略能增加局部开发能力. 实验结果表明, 所提出算法的性能较几种经典PSO 算法有显著的提升. 关键词: 骨干粒子群；剪枝策略；粒子多样性；全局探索能力；局部开发能力 中图分类号: TP301.6 文献标志码: A Pruning strategy based bare bones particle swarm optimization ZHANG Zhen, PAN Zai-ping, PAN Xiao-hong (College of Engineering，Zhejiang University ，Hangzhou 310000 ，China ．Correspondent ：PAN Zai-ping ，E-mail: panzaiping@zju.edu.cn) Abstract: A bare bones particle swarm optimization(NPSO) algorithm is proposed to improve both global exploration and local exploitation. An evolution equation which obtains better swarm diversity is employed in the NPSO algorithm. Inspired by the apical dominance phenomenon in biology, a particle pruning strategy is introduced as follows: When a particle reaches a new best position of the swarm, it would be pruned and inserted to another position. Theoretical analysis shows that the pruning strategy can improve both global exploration and local exploitation. Finally, results of the experiments on benchmark problems show that the proposed algorithm obtains significant improvement when compared to some classical PSO algorithms. Keywords: bare bones PSO ；particle pruning strategy ；swarm diversity；global exploration ；local exploitation 0 引引引 言言言