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

基于alpha支配的高维目标进化算法研究
引用本文:林梦嫚,周欢,王丽萍.基于alpha支配的高维目标进化算法研究[J].计算机科学,2017,44(1):264-270.
作者姓名:林梦嫚  周欢  王丽萍
作者单位:浙江工业大学经贸管理学院 杭州310023,浙江工业大学信息工程学院 杭州310023,浙江工业大学经贸管理学院 杭州310023;浙江工业大学信息智能与决策优化研究所 杭州310023
基金项目:本文受国家自然科学基金:基于多偏好与变量分解的大规模高维目标优化方法及应用研究(61472366),基于轮廓线段簇的隐式形状模型及其优化方法研究(6139077),浙江省自然科学基金:融合侧步爬山策略的大规模变量多目标协同进化算法研究(LY13F030010),基于双极偏好占优的高维目标进化算法研究(LZ13F020002)资助
摘    要:基于Pareto支配的多目标进化算法能够很好地处理2~3维的多目标优化问题。但在处理高维多目标问题时,随着目标维数的增大,支配受阻解的数量急剧增加,导致现有的多目标算法存在选择压力不够、优化效果较差的问题。通过引入α支配提供严格的Pareto分层,在同层中挑选相对稀疏的解作为候选解,同时详细分析不同α对算法性能的影响,提出一种新的基于α偏序和拥塞距离抽样的高维目标进化算法。将该算法在DTLZ上进行性能测试,并采用世代距离(GD)、空间评价(SP)、超体积(HV)等多个指标评估算法的性能。实验结果表明,引入α支配能去除绝大部分支配受阻解(DRSs),提高算法的收敛性。与快速非支配排序算法(NSGA-II)、基于分解的多目标进化算法(MOEA/D)、基于距离更新的分解多目标进化算法(MOEA/D-DU)相比,该算法的整体解集的质量 有明显提高。

关 键 词:高维目标优化  非支配受阻解  拥塞距离  超体积
收稿时间:2016/3/28 0:00:00
修稿时间:2016/7/11 0:00:00

Research of Many-objective Evolutionary Algorithm Based on Alpha Dominance
LIN Meng-man,ZHOU Huan and WANG Li-ping.Research of Many-objective Evolutionary Algorithm Based on Alpha Dominance[J].Computer Science,2017,44(1):264-270.
Authors:LIN Meng-man  ZHOU Huan and WANG Li-ping
Affiliation:College of Economics and Management,Zhejiang University of Technology,Hangzhou 310023,China,College of Information Engineering,Zhejiang University of Technology,Hangzhou 310023,China and College of Economics and Management,Zhejiang University of Technology,Hangzhou 310023,China;Institute of Information Intelligence and Decision Optimization,Zhejiang University of Technology,Hangzhou 310023,China
Abstract:The classic multiobjective evolutionary algorithms based on the Pareto dominance solve the problems with 2 to 3 objectives effectively.However,when dealing with many-objective problems,as the number of dominance resistant solutions is rapidly increasing owing to the increase of the objectives,the existed multiobjective algorithms lack of the selection pressure towards the Pareto front,and the optimization effect becomes bad.In this paper,we analyzed the influence of different alpha values,then provided strict Pareto layer,and selected the relatively sparse solution as candidate solutions in the same layer.At last,we proposed a new many-objective evolutionary algorithm based on alpha partial order and congestion distance sampling.The performance of the algorithms was evaluated by generation distances(GD),spacing(SP),highpervolume(HV) on the DTLZ problems.The experimental results show that the convergence of the algorithm improves greatly through eliminating the DRSs.Compared with the NSGA-II,MOEA/D and MOEA/D-DU,the overall quality of the solutions by the improved algorithms increases greatly.
Keywords:Many-objective optimization  Dominance resistance solutions  Congestion distance  Highpervolume
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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