首页 | 官方网站   微博 | 高级检索  
     

一种改进的非支配排序多目标遗传算法
引用本文:程楠,龚小胜,梁雨婷.一种改进的非支配排序多目标遗传算法[J].计算机与数字工程,2010,38(4):23-25,77.
作者姓名:程楠  龚小胜  梁雨婷
作者单位:中国地质大学,武汉,计算机学院,武汉,430074
摘    要:多目标进化算法的研究目标是使算法快速收敛,并且广泛而均匀分布于问题的非劣最优域。在NSGA-Ⅱ算法的基础上,提出了一种新的变异算子。该算子具有良好的局部搜索能力,提高了算法的效率。改进后的算法与原算法相比较,结果表明新算法较好地改善了分布性和收敛性。

关 键 词:多目标优化问题  多目标进化算法  NSGA-Ⅱ  高斯变异

An Improved Non-dominated Sorting Multi-objective Genetic Algorithm
Cheng Nan Gong Xiaosheng Liang Yuting.An Improved Non-dominated Sorting Multi-objective Genetic Algorithm[J].Computer and Digital Engineering,2010,38(4):23-25,77.
Authors:Cheng Nan Gong Xiaosheng Liang Yuting
Affiliation:School of Computer China University of Geosciences/a>;Wuhan 430074
Abstract:The main goal for research on MOEAs is to make the algorithm converge rapidly,and gain solutions that are widely and uniformly scattered in the non-dominated feasible areas of the problem.This paper,which is on the basis of NSGA-Ⅱ,proposes a new mutation operator.The operator has a good local search capability,improve the efficiency of the algorithm.The improved algorithm is compared with the orginal NSGA-Ⅱ,and the results shows that the new one can better improve the diversity and the convergence of the solution set.
Keywords:multi-objective optimal problem  multi-objective evolutionary algorithms  NSGA-Ⅱ  gaussian mutation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号