| 基于拥挤距离的多目标粒子群算法 |
| |
| 引用本文： | 杨善学. 基于拥挤距离的多目标粒子群算法[J]. 计算机工程与应用, 2009, 45(22): 24-26. DOI: 10.3778/j.issn.1002-8331.2009.22.008 |
| |
| 作者姓名： | 杨善学 |
| |
| 作者单位： | 西安财经学院统计学院,西安,710061 |
| |
| 摘 要： | 该算法通过引用NSGA-II中的拥挤距离，确定外部档案中非支配解的拥挤度，依据竞标赛选择方法选出每个粒子的全局最优位置，引导每个粒子向处于较稀松区域的非支配解搜索，提高了解的多样性。动态变异算子的引入，减缓了算法的收敛速度，增大了解的搜索区域，避免了算法早熟收敛或陷入局部最优。实验结果表明，算法CDMOPSO比NSGA-II具有更好的收敛性和维持种群多样性的能力。
|
| 关 键 词： | 粒子群算法 拥挤距离 竞标赛选择方法 动态变异算子 |
| 收稿时间： | 2008-05-26 |
| 修稿时间： | 2008-9-1 |
Multiobjective particle swarm optimization based on crowding distance |
| |
| YANG Shan-xue. Multiobjective particle swarm optimization based on crowding distance[J]. Computer Engineering and Applications, 2009, 45(22): 24-26. DOI: 10.3778/j.issn.1002-8331.2009.22.008 |
| |
| Authors: | YANG Shan-xue |
| |
| Affiliation: | School of Statistics，Xi’an University of Finance and Economics，Xi’an 710061，China |
| |
| Abstract: | The crowing distance proposed in NSGA-II is adopted to calculate the crowing degree of the nondominated solutions in the external archive in this paper.The globally optimal position of each particle is predicted according to tournament selection scheme,and each particle is then guided to a sparse region of nondominated solutions.As a result,it is helpful for an algorithm to find a better distribution of the nondominated solutions.Moreover,the adoption of the dynamic mutation operator is beneficial to avoid ... |
| |
| Keywords: | Particle Swarm Optimization (PSO) crowding distance tounament selection dynamic mutation operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
