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

一种基于分解和协同的高维多目标进化算法
引用本文:谢承旺,余伟伟,闭应洲,汪慎文,胡玉荣. 一种基于分解和协同的高维多目标进化算法[J]. 软件学报, 2020, 31(2): 356-373
作者姓名:谢承旺  余伟伟  闭应洲  汪慎文  胡玉荣
作者单位:南宁师范大学计算机与信息工程学院,广西南宁 530299;北京工业大学软件学院,北京 100124;河北地质大学信息工程学院,河北石家庄050031;荆楚理工学院科技处,湖北荆门448000
基金项目:国家自然科学基金(61763010,61402481,61165004);广西八桂学者项目;河北青年拔尖人才支持计划(冀字[2013]17号);河北省自然科学基金(F2015403046);河北省教育厅科技重点项目(ZD2018083);湖北省教育厅科研项目(B2015240);科学计算与智能信息处理广西高校重点实验室开放课题(GXSCIIP201604);荆楚理工学院科学研究重点基金项目(ZR201402);荆楚理工学院科学研究引进人才科研启动金项目(QDB201605)
摘    要:现实中大量存在的高维多目标优化问题对以往高效的多目标进化算法提出了严峻的挑战.通过将分解策略和协同策略相结合提出一种高维多目标进化算法MaOEA/DCE.该算法利用混合水平正交实验方法在聚合系数空间产生一组均匀分布的权重向量以改善初始种群的分布性;其次,算法将差分进化算子和自适应SBX算子进行协同进化,以产生高质量的子代个体,并改善算法的收敛性.该算法与另外5种高性能的多目标进化算法在基准测试函数集DTLZ{1,2,4,5}上进行对比实验,利用改进的反转世代距离指标IGD+评估各算法的性能.实验结果表明,Ma OEA/DCE算法与其他对比算法相比,在总体上具有较为显著的收敛性和分布性优势.

关 键 词:高维多目标优化  分解策略  混合水平正交实验设计  高维多目标进化算法
收稿时间:2018-04-01
修稿时间:2018-05-25

Many-objective Evolutionary Algorithm Based on Decomposition and Coevolution
XIE Cheng-Wang,YU Wei-Wei,BI Ying-Zhou,WANG Shen-Wen and HU Yu-Rong. Many-objective Evolutionary Algorithm Based on Decomposition and Coevolution[J]. Journal of Software, 2020, 31(2): 356-373
Authors:XIE Cheng-Wang  YU Wei-Wei  BI Ying-Zhou  WANG Shen-Wen  HU Yu-Rong
Affiliation:School of Computer and Information Engineering, Guangxi Teachers Education University, Nanning 530299, China;Guangxi Colleges and Universities Key Laboratory Scientific Computing and Intelligent Information Processing(Guangxi Teachers Education University), Nanning 530299, China,School of Software Engineering, Beijing University of Technology, Beijing, 100124, China,School of Computer and Information Engineering, Guangxi Teachers Education University, Nanning 530299, China;Guangxi Colleges and Universities Key Laboratory Scientific Computing and Intelligent Information Processing(Guangxi Teachers Education University), Nanning 530299, China,School of Information Engineering, Hebei Dizhi University, Shijiazhuang, Hebei 050031, China and Department of Science and Technology, Jingchu University of Technology, Jingmen 448000, China
Abstract:In reality, many-objective optimization problems (MaOPs) are ubiquitous, and their huge objective space makes representative multi-objective evolutionary algorithms face severe challenges. A many-objective evolutionary algorithm based on decomposition and coevolution (MaOEA/DCE) is proposed in the paper. The method of mix-level orthogonal experimental design is used to generate an even-distributed set of weight vectors in the space of weight coefficient in order to improve the population diversity. Second, the differential evolution operator is combined with the adaptive SBX operator to generate high-quality offspring, so as to improve the convergence of MaOEA/DCE. The MaOEA/DCE is compared with other five representative multi-objective evolutionary algorithms on the benchmark test set DTLZ{1,2,4,5} based on the performance of IGD+, and the experimental results show that the presented algorithm has more significant performance advantages of convergence, diversity and robustness over the peering algorithms.
Keywords:many-objective optimization|decomposition|mix-level orthogonal experimental design|many-objective evolutionary algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号