均衡分布性与收敛性多目标粒子群优化方法.docVIP

均衡分布性与收敛性多目标粒子群优化方法 　　文章编号:10019081(2013)07192604 doi:10.11772/j.issn.10019081.2013.07.1926 摘 要: 粒子群优化（PSO）算法是一种基于群体演化且非常有效的求解多目标优化问题的方法，但因经典算法中粒子进化存在趋同性导致算法易陷入局部Pareto最优前沿，使得解集收敛性和分布性不理想。为此提出了一种均衡分布性和收敛性的多目标粒子群优化（DWMOPSO）算法，算法中每个粒子根据自身在进化过程中记忆的个体最好适应度值构建进化速度，由进化速度的快慢动态调整各粒子惯性权重,增加粒子的多样性，从而提高粒子跳出局部最优解的概率。通过在5个标准测试函数上进行仿真实验，结果表明，与Coello的多目标粒子群优化(MOPSO)算法相比，DWMOPSO算法获得的解集在与真实解集的逼近性和解集的分布性两个方面都有了很大的提高。 关键词:粒子群优化算法；多目标优化；局部最优；动态惯性权重 中图分类号: TP183 文献标志码:A 英文标题 Multiobjective particle swarm optimization method with balanced diversity and convergence 英文作者名 GENG Huantong1,2*, GAO Jun1,2, JIA Tingting1,2, WU Zhengxue1,2 英文地址( 1. Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science and Technology, Nanjing Jiangsu 210044, China; 2. College of Computer and Software, Nanjing University of Information Science and Technology, Nanjing Jiangsu 210044, China 英文摘要) Abstract: Particle Swarm Optimization (PSO) algorithm is populationbased and it is effective for multiobjective optimization problems. For the convergence of the swarm makes the classical algorithm easily converge to local pareto front, the convergence and diversity of the solution are not satisfactory. This paper proposed an independent dynamic inertia weights method for multiobjective particle swarm optimization (DWMOPSO). It changed each particles inertia weight according to the evolution speed which was calculated by the value of each particles best fitness in the history. It improved the probability to escape from the local optima. In comparison with Coellos MOPSO through five standard test functions, the solution of the new algorithm has great improvement both in the convergence to the true Pareto front and diversity. Particle Swarm Optimization (PSO) algorithm is populationbased and it is effective for multiobjective optimization problems. For the convergence of the swarm makes the class