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

一种高效的多目标演化算法
引用本文:黄樟灿,焉炳艳,谢啸虎.一种高效的多目标演化算法[J].计算机工程与应用,2007,43(11):75-77.
作者姓名:黄樟灿  焉炳艳  谢啸虎
作者单位:1. 武汉理工大学,理学院,武汉,430070
2. 武汉理工大学,计算机学院,武汉,430070
摘    要:为了提高非劣解向Pareto最优前沿收敛的速度及进一步提高解的精度,在设计了一种新的杂交算子并改进了NSGA-Ⅱ的拥挤操作的基础上,提出了一种基于分级策略的多目标演化算法。数值实验表明,新算法能够非常高效地处理高维的最优前沿为凸的、非凸的和不连续前沿的多目标测试函数,得到的非劣解具有很好的分布性质。但在处理高维的具有太多局部最优前沿的多峰函数时极易陷入局部最优前沿。

关 键 词:多目标优化问题  多目标演化算法  Pareto最优
文章编号:1002-8331(2007)11-0075-03
收稿时间:2006-5-16
修稿时间:2006-08

An Effective Multi-objective Evolutionary Algorithm
HUANG Zhang-can,YAN Bing-yan,XIE Xiao-hu.An Effective Multi-objective Evolutionary Algorithm[J].Computer Engineering and Applications,2007,43(11):75-77.
Authors:HUANG Zhang-can  YAN Bing-yan  XIE Xiao-hu
Affiliation:1.School of Science,Wuhan University of Technology,Wuhan 430070,China ;2.School of Computer Science,Wuhan University of Technology,Wuhan 430070,China
Abstract:This paper proposes a novel muiti-objective evolutionary algorithm, based on a novel crossover operation and improved crowding operation of NSGA-II ,in order to quicken further rate of convergence of solutions to Pareto optimal front and improve precision of solutions. The numeric experiments results indicate the new algorithm is very efficient for multi-objective test problems of high-dimension with Pareto optimal front of convex or non-convex or discontinuous and convex and multi-modal. The obtained non-dominated solutions have a good distribution property. But as to high-dimension functions with too many local Pareto optimal fronts, it traps in local Pareto optimal front easily.
Keywords:multi-objective optimization problem  multi-objective evolutionary algorithm  Pareto optimality
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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