基于Lévy变异的微粒群算法①.PDF

2016 年 第25 卷 第 10 期 计 算 机 系 统 应 用 ① 基于Lévy 变异的微粒群算法 林振思 1,2, 张岐山 1 1(福州大学 经济与管理学院, 福州 350116) 2(福建工程学院 管理学院, 福州 350118) 摘 要: 微粒群算法因其实现简单及优化效果较好而得到广泛应用, 但也存在易早熟和局部收敛的缺点; 结合 Lévy 飞行的特性, 提出了一种新的带 Lévy 变异的微粒群算法, 并对其收敛性进行分析, 指出该算法依概率收敛 于全局最优解. 通过对 8 个标准测试函数的仿真实验, 结果表明改进算法中的 Lévy 变异能够利用粒子的当前知 识并增加群体的多样性, 从而能够更有效地平衡局部搜索和全局搜索, 使其具有更好的性能, 最后对改进算法的 各参数设置进行了探讨分析. 关键词: Lévy 分布; 微粒群算法; 变异; 多样性 Particle Swarm Optimization Based on Lévy Mutation LIN Zhen-Si1,2, ZHANG Qi-Shan1 1(School of Economics and Management, Fuzhou University, Fuzhou 350116, China) 2(School of Management, Fujian University of Technology, Fuzhou 350118, China) Abstract: Particle swarm optimization (PSO) was applied in many fields because of its simplicity and fast convergence, but it is easily prone to be premature and get struck in local optima. Combination with the characteristics of Lévy flight, this paper proposes a new variation of PSO with Lévy mutation (LévyPSO), and then analyzed it’s convergence and pointed out that the algorithm convergence in probability for the global optima. The experiments is conducted on 8 classic benchmark functions, the results show that the Lévy mutation can use the current knowledge of particles and increase the diversity of population. Thus, the proposed algorithm has better performance because of it can more effectively balance the global search and local search. The parameters settings of the proposed algorithm are discussed in the final. Key words: Lévy distribution; particle swarm optimization; mutation; diversity Kennedy 和 Eberhart 于 1995 年提出了一种基于种