首页 | 本学科首页   官方微博 | 高级检索  
     

NSGA-Ⅱ算法的改进策略研究
引用本文:陈婕,熊盛武,林婉如.NSGA-Ⅱ算法的改进策略研究[J].计算机工程与应用,2011,47(19):42-45.
作者姓名:陈婕  熊盛武  林婉如
作者单位:武汉理工大学计算机学院,武汉,430070
基金项目:国家自然科学基金,武汉市国际交流与合作项目
摘    要:带精英策略的非支配排序遗传算法(NSGA-Ⅱ)在多目标优化领域具有广泛的应用,但该算法种群收敛分布不均匀,全局搜索能力较弱,算法运行速度较慢。针对这些局限性提出了改进的排序适应度策略、算术交叉算子策略、按需分层策略和设定阈值选择策略。在典型的测试函数集上的数值实验结果表明,根据这些策略改进的算法得到的非劣解集具有较好的分布性,同时收敛速度更快。

关 键 词:多目标优化算法  带精英策略的非支配排序遗传算法(NSGA-Ⅱ)  Pareto最优
修稿时间: 

Improved strategies and researches of NSGA-H algorithm
CHEN Jie,XIONG Shengwu,LIN Wanru.Improved strategies and researches of NSGA-H algorithm[J].Computer Engineering and Applications,2011,47(19):42-45.
Authors:CHEN Jie  XIONG Shengwu  LIN Wanru
Affiliation:Department of Computer Science and Technology,Wuhan University of Technology,Wuhan 430070,China
Abstract:Non-dominated Sorting Genetic Algorithm with elitism(NSGA-Ⅱ) is widely used in multi-objective optimization fields.Uneven distribution of population convergence,poor performance in global search and low running efficiency of this algorithm are analyzed in this paper.Four improved strategies are proposed according to these limitations:improved sorting strategy,arithmetic cross operator strategy,sorting rank according to the demand strategy and selecting strategy with the given threshold.The simulations prove that the non-dominated Pareto optimal solutions have better distribution and faster convergence at the same time in typical functions.
Keywords:multi-objective optimization algorithm  Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ)  Pareto optimal
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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