Article(id=1329460817042452701, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1329460564176253901, articleNumber=null, orderNo=null, doi=10.7544/issn1000-1239.202330093, pmid=null, cstr=null, oa=null, hot=null, price=null, onlineType=0, articleFormat=0, articleType=null, articleTypeStr=null, receivedDate=1676476800000, receivedDateStr=2023-02-16, revisedDate=1703779200000, revisedDateStr=2023-12-29, acceptedDate=1709654400000, acceptedDateStr=2024-03-06, onlineDate=1794897758970, onlineDateStr=2026-11-17, pubDate=1730390400000, pubDateStr=2024-11-01, doiRegisterDate=null, doiRegisterDateStr=null, onlineIssueDate=1794897758970, onlineIssueDateStr=2026-11-17, onlineJustAcceptDate=null, onlineJustAcceptDateStr=null, onlineFirstDate=null, onlineFirstDateStr=null, sourceXml=null, magXml=null, createTime=1794897758970, creator=13701087609, updateTime=1794897758970, updator=13701087609, issue=Issue{id=1329460564176253901, tenantId=1146029695717560320, journalId=1324759914146529478, year='2024', volume='61', issue='11', pageStart='2663', pageEnd='2936', issueExtLink='null', onlineDate='null', pubDate='1730390400000', pubDateStr='2024-11-01', beforeIssueId=null, nextIssueId=null, price=null, status=1, issueComplete=1, articleOrder=1, issueType=-1, specialIssue=null, createTime=1794897698682, creator='13701087609', updateTime=1794897698682, updator='13701087609', preIssue=null, nextIssue=null, articleTotal=null, ext=null, issueFiles=null, downloadFileDto=null}, startPage=2909, endPage=2922, ext={EN=ArticleExt(id=1329460817256362206, articleId=1329460817042452701, tenantId=1146029695717560320, journalId=1324759914146529478, language=EN, title=A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition, columnId=1325489891789910943, journalTitle=Journal of Computer Research and Development, columnName=Artificial Intelligence, runingTitle=null, highlight=null, articleAbstract=

Multi-objective optimization problems are common in real-world applications. However, the high computational complexity severely hinders their solution. Currently, multi-objective evolutionary algorithms are mostly used for their solving. Nevertheless, these methods usually contain random operations in the process of population initialization and evolution to maintain diversity, which leads to non-reproducibility and lacking the theoretical guarantee of global convergence. Therefore, a novel multi-objective Dividing Rectangles(DIRECT) algorithm is introduced based on decomposition strategy. In this algorithm, the original problem is decomposed into a series of subproblems by a normalized decomposition method that can better capture the complex frontier to reduce the computational complexity of the problem. Meanwhile, the Dividing Rectangles algorithm is used to simultaneously optimize the decomposed subproblems, and the generated candidate solutions are assigned to the corresponding subproblems based on the global association mechanism in the optimization process to better retain the good candidate solutions and improve the algorithm search efficiency. Finally, the convergence of the algorithm is demonstrated. To further improve the computational efficiency, a multi-level and multi-granularity parallel scheme based on the adaptive associative migration strategy is proposed, based on which the proposed algorithm is parallelized. Furthermore, the proposed algorithm and its parallel version are applied to several benchmark optimization problems, and the experimental results show that the proposed algorithm can obtain a Pareto set with better convergence and diversity than NSGA-II, and the parallel version can further improve the accuracy of Pareto frontier approximation while massively reducing the problem-solving time.

, authors=Chen Li1, Yidong Chen1, 2, Zhonghua Lu1, Xueying Yang1, 2, Zitian Wang3, Xuebin Chi1, authorsList=Chen Li, Yidong Chen, Zhonghua Lu, Xueying Yang, Zitian Wang, Xuebin Chi, authorCompany=null, correspAuthors=null, authorNote=

born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

, correspAuthorsNote=null, copyrightStatement=Copyright © 2024 Journal of Computer Research and Development. All rights reserved., copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=null, magXml=null, pdfUrl=null, pdf=null, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=null, mapNumber=null, fund=null), CN=ArticleExt(id=1329460821844930819, articleId=1329460817042452701, tenantId=1146029695717560320, journalId=1324759914146529478, language=CN, title=基于归一分解的并行多目标Dividing Rectangles算法, columnId=1325489892104483745, journalTitle=计算机研究与发展, columnName=人工智能, runingTitle=null, highlight=null, articleAbstract=

多目标优化问题普遍存在且难以解决,目前多采用多目标进化算法进行求解. 然而,这些方法通常在种群初始化阶段和进化过程中包含随机操作以保持多样性,导致了其结果不可复现且缺乏全局收敛的理论保证. 鉴于此,提出了一种基于归一分解的多目标Dividing Rectangles(DIRECT)算法,首先通过一种可较好捕捉复杂前沿的归一分解方法将原问题分解为一系列子问题,以降低问题计算复杂度;其次,采用Dividing Rectangles算法同时优化分解得到的子问题,并在优化过程中基于全局关联机制将生成的候选解分配给相应的子问题,以更好地保留优秀候选解并提高算法搜索效率;最后,证明了算法的收敛性. 此外,为了进一步提高计算效率,提出了一种基于自适应关联迁移策略的多层次多粒度并行方案,并基于该方案对所提出的算法进行了并行化. 将所提算法应用于多个基准优化问题,实验结果表明,相比于NSGA-II,所提串行算法能够产生收敛性、多样性更为优越的帕累托最优解集,并行算法可在大规模缩短问题求解时间的同时,进一步提升帕累托前沿近似精度.

, authors=李晨1, 陈逸东1, 2, 陆忠华1, 杨雪莹1, 2, 王子田3, 迟学斌1, authorsList=李晨, 陈逸东, 陆忠华, 杨雪莹, 王子田, 迟学斌, authorCompany=null, correspAuthors=null, authorNote=

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

, correspAuthorsNote=null, copyrightStatement=版权所有 © 2024 计算机研究与发展编辑部, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=QJ/q1I0GKwvc18PqeigOrw==, magXml=nt4TJVnG1AcxgphrYwAQVg==, pdfUrl=null, pdf=JsTLWH4jY7mqyidloIeZ4w==, pdfFileSize=2019455, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=gheGihmg7mkXJdPROp9Zzw==, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=ukoCTZU9K7Ubg6RKweBxZw==, mapNumber=null, fund=null)}, authors=[Author(id=1329460823925305614, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=lichen@sccas.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824009191696, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460823925305614, language=EN, stringName=Chen Li, firstName=Chen, middleName=null, lastName=Li, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

"}, bioImg=null, bioContent=

born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824097272081, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460823925305614, language=CN, stringName=李晨, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"GQ9LANpiHCxCoLNL4JKvJQ==","content":"

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

"}, bioImg=GQ9LANpiHCxCoLNL4JKvJQ==, bioContent=

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])]), Author(id=1329460824202129683, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=chenyidong@cnic.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824332153110, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824202129683, language=EN, stringName=Yidong Chen, firstName=Yidong, middleName=null, lastName=Chen, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083
2University of Chinese Academy of Sciences, Beijing 100049, bio={"content":"

born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

"}, bioImg=null, bioContent=

born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824466370839, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824202129683, language=CN, stringName=陈逸东, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1中国科学院计算机网络信息中心 北京 100083
2中国科学院大学 北京 100049, bio={"img":"vo/k5ggJ3RSbuP7JnaQj7Q==","content":"

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

"}, bioImg=vo/k5ggJ3RSbuP7JnaQj7Q==, bioContent=

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)]), AuthorCompany(id=1329460822226612487, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=2, ext=[AuthorCompanyExt(id=1329460822235001096, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2University of Chinese Academy of Sciences, Beijing 100049), AuthorCompanyExt(id=1329460822243389705, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2中国科学院大学 北京 100049)])]), Author(id=1329460824525091097, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=zhlu@cnic.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824592199963, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824525091097, language=EN, stringName=Zhonghua Lu, firstName=Zhonghua, middleName=null, lastName=Lu, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

"}, bioImg=null, bioContent=

born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824650920220, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824525091097, language=CN, stringName=陆忠华, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"u44VrNO1uvwCiJrMqRjlHg==","content":"

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

"}, bioImg=u44VrNO1uvwCiJrMqRjlHg==, bioContent=

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])]), Author(id=1329460824709640478, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=3, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824780943649, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824709640478, language=EN, stringName=Xueying Yang, firstName=Xueying, middleName=null, lastName=Yang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083
2University of Chinese Academy of Sciences, Beijing 100049, bio={"content":"

born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

"}, bioImg=null, bioContent=

born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824873218338, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824709640478, language=CN, stringName=杨雪莹, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1中国科学院计算机网络信息中心 北京 100083
2中国科学院大学 北京 100049, bio={"img":"rxLDiAdQi9/WekLAOCV9BA==","content":"

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

"}, bioImg=rxLDiAdQi9/WekLAOCV9BA==, bioContent=

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)]), AuthorCompany(id=1329460822226612487, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=2, ext=[AuthorCompanyExt(id=1329460822235001096, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2University of Chinese Academy of Sciences, Beijing 100049), AuthorCompanyExt(id=1329460822243389705, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2中国科学院大学 北京 100049)])]), Author(id=1329460824936132900, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=4, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=wzt@aihpc.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824999047462, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824936132900, language=EN, stringName=Zitian Wang, firstName=Zitian, middleName=null, lastName=Wang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=3, address=3Beijing AIHPC Co., Ltd., Beijing 100037, bio={"content":"

born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

"}, bioImg=null, bioContent=

born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460825053573415, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824936132900, language=CN, stringName=王子田, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=3, address=3北京智速科技有限公司 北京 100037, bio={"img":"eFZdd5aLpl6TtyKbWsc/tA==","content":"

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

"}, bioImg=eFZdd5aLpl6TtyKbWsc/tA==, bioContent=

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460823845613834, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=3, ext=[AuthorCompanyExt(id=1329460823854002443, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Beijing AIHPC Co., Ltd., Beijing 100037), AuthorCompanyExt(id=1329460823862391052, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3北京智速科技有限公司 北京 100037)])]), Author(id=1329460825137459497, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=5, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=chi@sccas.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460825212956971, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460825137459497, language=EN, stringName=Xuebin Chi, firstName=Xuebin, middleName=null, lastName=Chi, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

"}, bioImg=null, bioContent=

born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460825288454444, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460825137459497, language=CN, stringName=迟学斌, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"2cbTqABE4Ny3rQuVZ3fT3g==","content":"

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

"}, bioImg=2cbTqABE4Ny3rQuVZ3fT3g==, bioContent=

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])])], keywords=[Keyword(id=1329460825414283565, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, orderNo=1, keyword=multi-objective optimization), Keyword(id=1329460825485586734, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, orderNo=2, keyword=objective space decomposition), Keyword(id=1329460825582055727, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, orderNo=3, keyword=Dividing Rectangles algorithm), Keyword(id=1329460825657553200, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, orderNo=4, keyword=parallel computing), Keyword(id=1329460825754022193, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, orderNo=5, keyword=global optimization), Keyword(id=1329460825825325362, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, orderNo=1, keyword=多目标优化), Keyword(id=1329460825917600051, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, orderNo=2, keyword=目标空间分解), Keyword(id=1329460826005680436, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, orderNo=3, keyword=Dividing Rectangles算法), Keyword(id=1329460826072789301, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, orderNo=4, keyword=并行计算), Keyword(id=1329460826144092470, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, orderNo=5, keyword=全局优化)], refs=[Reference(id=1329460829809914193, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=1, rfOrder=0, authorNames=null, journalName=null, refType=null, unstructuredReference=Wong C S Y, Al-Dujaili A, Sundaram S. Hypervolume-based direct for multi-objective optimization [C] //Proc of the 16th Genetic and Evolutionary Computation Conf Companion. New York: ACM, 2016: 1201−1208, articleTitle=null, refAbstract=null), Reference(id=1329460829877023058, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=2, rfOrder=1, authorNames=null, journalName=null, refType=null, unstructuredReference=田野. 高维多目标优化算法的若干关键问题研究 [D]. 合肥:安徽大学,2015, articleTitle=null, refAbstract=null), Reference(id=1329460829939937619, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=2, rfOrder=2, authorNames=null, journalName=null, refType=null, unstructuredReference=Tian Ye. Research on several key problems of many-objective optimization algorithms [D]. Hefei: Anhui University, 2015 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460830007046484, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=3, rfOrder=3, authorNames=null, journalName=null, refType=null, unstructuredReference=Zelinka I. A survey on evolutionary algorithms dynamics and its complexity−Mutual relations, past, present and future[J]. Swarm and Evolutionary Computation, 2015, 25: 2−14, articleTitle=null, refAbstract=null), Reference(id=1329460830065766741, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=4, rfOrder=4, authorNames=null, journalName=null, refType=null, unstructuredReference=Hernandez Gomez R, Coello Coello C A, Alba E. A parallel version of SMS-EMOA for many-objective optimization problems [C] // Proc of the 16th Genetic and Evolutionary Computation Conf Companion. New York: ACM, 2016: 568−577, articleTitle=null, refAbstract=null), Reference(id=1329460830141264214, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=5, rfOrder=5, authorNames=null, journalName=null, refType=null, unstructuredReference=Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182−197, articleTitle=null, refAbstract=null), Reference(id=1329460830204178775, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=6, rfOrder=6, authorNames=null, journalName=null, refType=null, unstructuredReference=Zhang Qingfu, Li Hui. MOEA/D: A multiobjective evolutionary algorithm based on decomposition[J]. IEEE Transactions on Evolutionary Computation, 2007, 11(6): 712−731, articleTitle=null, refAbstract=null), Reference(id=1329460830262899032, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=7, rfOrder=7, authorNames=null, journalName=null, refType=null, unstructuredReference=Deb K, Jain H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints[J]. IEEE Transactions on Evolutionary Computation, 2013, 18(4): 577−601, articleTitle=null, refAbstract=null), Reference(id=1329460830321619289, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=8, rfOrder=8, authorNames=null, journalName=null, refType=null, unstructuredReference=Mashwani W K. MOEA/D with DE and PSO: MOEA/D-DE+ PSO [C] //Proc of the 31st SGAI Int Conf on Innovative Techniques and Applications of Artificial Intelligence. Berlin: Springer, 2011: 217−221, articleTitle=null, refAbstract=null), Reference(id=1329460830434865498, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=9, rfOrder=9, authorNames=null, journalName=null, refType=null, unstructuredReference=Jones D R, Perttunen C D, Stuckman B E. Lipschitzian optimization without the Lipschitz constant[J]. Journal of Optimization Theory and Applications, 1993, 79(1): 157−181, articleTitle=null, refAbstract=null), Reference(id=1329460830493585755, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=10, rfOrder=10, authorNames=null, journalName=null, refType=null, unstructuredReference=Jones D R, Martins J R. The DIRECT algorithm: 25 years later[J]. Journal of Global Optimization, 2021, 79((3): ): 521−566, articleTitle=null, refAbstract=null), Reference(id=1329460830543917404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=11, rfOrder=11, authorNames=null, journalName=null, refType=null, unstructuredReference=Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257−271, articleTitle=null, refAbstract=null), Reference(id=1329460830611026269, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=12, rfOrder=12, authorNames=null, journalName=null, refType=null, unstructuredReference=唐炜森. 基于hypervolume的多目标优化算法研究 [D]. 广州:广东工业大学,2018, articleTitle=null, refAbstract=null), Reference(id=1329460830669746526, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=12, rfOrder=13, authorNames=null, journalName=null, refType=null, unstructuredReference=Tang Weisen. Research on hypervolume based evolutionary multi-objective optimization algorithms [D]. Guangzhou: Guangdong University of Technology, 2018 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460830749438303, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=13, rfOrder=14, authorNames=null, journalName=null, refType=null, unstructuredReference=刘垚,郑琳,郑凯,等. 基于申威众核处理器的NSGA-Ⅱ并行和优化方法[J]. 计算机应用研究,2020,37(1):96−101, articleTitle=null, refAbstract=null), Reference(id=1329460830808158560, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=13, rfOrder=15, authorNames=null, journalName=null, refType=null, unstructuredReference=Liu Yao, Zheng Lin, Zheng Kai, et al. Parallelization and optimization of NSGA-Ⅱ based on Sunway many-core processor[J]. Application Research of Computers, 2020, 37(1): 96−101 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460830875267425, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=14, rfOrder=16, authorNames=null, journalName=null, refType=null, unstructuredReference=Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm[J]. Technical Report Gloriastrasse, 2001, 103(1): 1−21, articleTitle=null, refAbstract=null), Reference(id=1329460830946570594, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=15, rfOrder=17, authorNames=null, journalName=null, refType=null, unstructuredReference=Zhan Zhihui, Li Jingjing, Cao Jiannong, et al. Multiple populations for multiple objectives: A coevolutionary technique for solving multiobjective optimization problems[J]. IEEE Transactions on Cybernetics, 2013, 43(2): 445−463, articleTitle=null, refAbstract=null), Reference(id=1329460831026262371, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=16, rfOrder=18, authorNames=null, journalName=null, refType=null, unstructuredReference=Liu Hailin, Gu Fangqing, Zhang Qingfu. Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems[J]. IEEE Transactions on Evolutionary Computation, 2014, 18(3): 450−455, articleTitle=null, refAbstract=null), Reference(id=1329460831084982628, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=17, rfOrder=19, authorNames=null, journalName=null, refType=null, unstructuredReference=Cheng Ran, Jin Yaochu, Olhofer M, et al. A reference vector guided evolutionary algorithm for many-objective optimization[J]. IEEE Transactions on Evolutionary Computation, 2016, 20(5): 773−791, articleTitle=null, refAbstract=null), Reference(id=1329460831152091493, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=18, rfOrder=20, authorNames=null, journalName=null, refType=null, unstructuredReference=Zitzler E, Künzli S. Indicator-based selection in multiobjective search [C] //Proc of the 8th Int Conf on Parallel Problem Solving from Nature-PPSN VIII. Berlin: Springer, 2004: 832−842, articleTitle=null, refAbstract=null), Reference(id=1329460832779481446, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=19, rfOrder=21, authorNames=null, journalName=null, refType=null, unstructuredReference=Bader J, Zitzler E. HypE: An algorithm for fast hypervolume-based many-objective optimization[J]. Evolutionary Computation, 2011, 19(1): 45−76, articleTitle=null, refAbstract=null), Reference(id=1329460832859173223, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=20, rfOrder=22, authorNames=null, journalName=null, refType=null, unstructuredReference=Falcón-Cardona J G, Coello Coello A C. A new indicator-based many-objective ant colony optimizer for continuous search spaces[J]. Swarm Intelligence, 2017, 11(1): 71−100, articleTitle=null, refAbstract=null), Reference(id=1329460832917893480, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=21, rfOrder=23, authorNames=null, journalName=null, refType=null, unstructuredReference=Shubert B O. A sequential method seeking the global maximum of a function [J]. SIAM Journal on Numerical Analysis, 1972, 9(3): 379−388, articleTitle=null, refAbstract=null), Reference(id=1329460832985002345, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=22, rfOrder=24, authorNames=null, journalName=null, refType=null, unstructuredReference=Wang Luyi, Ishida H, Hiroyasu T, et al. Examination of multiobjective optimization method for global search using DIRECT and GA [C] //Proc of the 2008 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2008: 2446−2451, articleTitle=null, refAbstract=null), Reference(id=1329460833060499818, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=23, rfOrder=25, authorNames=null, journalName=null, refType=null, unstructuredReference=Al-Dujaili A, Suresh S. Dividing rectangles attack multi-objective optimization [C] //Proc of the 2016 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2016: 3606−3613, articleTitle=null, refAbstract=null), Reference(id=1329460833207300459, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=24, rfOrder=26, authorNames=null, journalName=null, refType=null, unstructuredReference=Campana E F, Diez M, Liuzzi G S, et al. A multi-objective direct algorithm for ship hull optimization[J]. Computational Optimization and Applications, 2018, 71(1): 53−72, articleTitle=null, refAbstract=null), Reference(id=1329460833286992236, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=25, rfOrder=27, authorNames=null, journalName=null, refType=null, unstructuredReference=Houssein E H, Mahdy M A, Shebl D, et al. An efficient slime mould algorithm for solving multi-objective optimization problems[J]. Expert Systems with Application, 2022, 187: 115870, articleTitle=null, refAbstract=null), Reference(id=1329460833375072621, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=26, rfOrder=28, authorNames=null, journalName=null, refType=null, unstructuredReference=Miettinen K. Nonlinear Multiobjective Optimization [M]. New York: Springer, 2012, articleTitle=null, refAbstract=null), Reference(id=1329460833471541614, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=27, rfOrder=29, authorNames=null, journalName=null, refType=null, unstructuredReference=万沙沙,裴丽,王喜奎,等. 利用DIRECT算法设计基于FBG延迟线的微波光子滤波器[J]. 光电技术应用,2008,23(6):41−44, articleTitle=null, refAbstract=null), Reference(id=1329460833542844783, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=27, rfOrder=30, authorNames=null, journalName=null, refType=null, unstructuredReference=Wan Shasha, Pei Li, Wang Xikui, et al. Design of PMF based on FBG delay line using DIRECT algorithm[J]. Electrooptic Technology Application, 2008, 23(6): 41−44 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460833672868208, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=28, rfOrder=31, authorNames=null, journalName=null, refType=null, unstructuredReference=何洪文,黄贤广,张亚明,等. 基于DIRECT算法的混合动力汽车参数优化研究[J]. 汽车工程学报,2011,1(1):35−41, articleTitle=null, refAbstract=null), Reference(id=1329460833756754289, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=28, rfOrder=32, authorNames=null, journalName=null, refType=null, unstructuredReference=He Hongwen, Huang Xianguang, Zhang Yaming, et al. Study on parameters optimization of hybrid electric vehicle based on DIRECT algorithm[J]. Chinese Journal of Automotive Engineering, 2011, 1(1): 35−41 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460833823863154, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=29, rfOrder=33, authorNames=null, journalName=null, refType=null, unstructuredReference=Mohammadi A, Omidvar M N, Li Xiaodong. Reference point based multi-objective optimization through decomposition [C] //Proc of the 2012 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2012: 1150−1157, articleTitle=null, refAbstract=null), Reference(id=1329460833890972019, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=30, rfOrder=34, authorNames=null, journalName=null, refType=null, unstructuredReference=魏建乐. 基于协同分解的多目标进化算法设计与应用 [D]. 广州:广州大学,2022, articleTitle=null, refAbstract=null), Reference(id=1329460833953886580, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=30, rfOrder=35, authorNames=null, journalName=null, refType=null, unstructuredReference=Wei Jianle. Design and application of multi-objective evolutionary algorithm based on cooperative decomposition [D]. Guangzhou: Guangzhou University, 2022 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460834041966965, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=31, rfOrder=36, authorNames=null, journalName=null, refType=null, unstructuredReference=王丽萍,吴峰,张梦紫,等. 基于差异化邻域策略的分解多目标进化算法[J]. 模式识别与人工智能,2017,30(12):1069−1082, articleTitle=null, refAbstract=null), Reference(id=1329460834146824566, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=31, rfOrder=37, authorNames=null, journalName=null, refType=null, unstructuredReference=Wang Liping, Wu Feng, Zhang Mengzi, et al. Decomposition multi-objective evolutionary algorithm based on differentiated neighborhood strategy[J]. Pattern Recognition and Artificial Intelligence, 2017, 30(12): 1069−1082 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460834281042295, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=32, rfOrder=38, authorNames=null, journalName=null, refType=null, unstructuredReference=Zitzler E, Deb K, Thiele L. Comparison of multiobjective evolutionary algorithms: Empirical results[J]. Evolutionary Computation, 2000, 8(2): 173−195, articleTitle=null, refAbstract=null), Reference(id=1329460834352345464, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=33, rfOrder=39, authorNames=null, journalName=null, refType=null, unstructuredReference=李璐. 基于双层分解的并行多目标演化算法研究 [D]. 西安:西安电子科技大学,2020, articleTitle=null, refAbstract=null), Reference(id=1329460834436231545, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=33, rfOrder=40, authorNames=null, journalName=null, refType=null, unstructuredReference=Li Lu. Research on parallel multi-objective evolutionary algorithm based on bi-level decomposition [D]. Xi’an: Xidian University, 2020 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460834532700538, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=34, rfOrder=41, authorNames=null, journalName=null, refType=null, unstructuredReference=Deb K, Thiele L, Laumanns M, et al. Scalable Test Problems for Evolutionary Multiobjective Optimization [M]. Berlin: Springer, 2005, articleTitle=null, refAbstract=null), Reference(id=1329460834620780923, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=35, rfOrder=42, authorNames=null, journalName=null, refType=null, unstructuredReference=葛梦瑶. 人工蜂群算法在多目标模糊投资组合优化中的应用 [D]. 北京:首都经济贸易大学,2016, articleTitle=null, refAbstract=null), Reference(id=1329460834700472700, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=35, rfOrder=43, authorNames=null, journalName=null, refType=null, unstructuredReference=Ge Mengyao. Application of artificial bee colony algorithm in multi-objective fuzzy portfolio optimization [D]. Beijing: Capital University of Economics and Business, 2016 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329460834754998653, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=36, rfOrder=44, authorNames=null, journalName=null, refType=null, unstructuredReference=Van Veldhuizen D A. Multiobjective evolutionary algorithms: Classifications, analyses, and new innovations [D]. Dayton, OH: Air Force Institute of Technology, 1999, articleTitle=null, refAbstract=null), Reference(id=1329460834855661950, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=37, rfOrder=45, authorNames=null, journalName=null, refType=null, unstructuredReference=Coello Coello C A, Reyes Sierra M. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm [C] //Proc of the 3rd Mexican Int Conf on Artificial Intelligence. Berlin: Springer, 2004: 688−697, articleTitle=null, refAbstract=null), Reference(id=1329460834918576511, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=38, rfOrder=46, authorNames=null, journalName=null, refType=null, unstructuredReference=Li Chen, Wu Yulei, Lu Zhonghua, et al. A multiperiod multiobjective portfolio selection model with fuzzy random returns for large scale securities data[J]. IEEE Transactions on Fuzzy Systems, 2021, 29(1): 59−74, articleTitle=null, refAbstract=null)], funds=null, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)]), AuthorCompany(id=1329460822226612487, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=2, ext=[AuthorCompanyExt(id=1329460822235001096, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2University of Chinese Academy of Sciences, Beijing 100049), AuthorCompanyExt(id=1329460822243389705, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2中国科学院大学 北京 100049)]), AuthorCompany(id=1329460823845613834, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=3, ext=[AuthorCompanyExt(id=1329460823854002443, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Beijing AIHPC Co., Ltd., Beijing 100037), AuthorCompanyExt(id=1329460823862391052, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3北京智速科技有限公司 北京 100037)])], figs=[ArticleFig(id=1329460826265727287, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 1, caption=Dominance of the candidate solutions (pentagrams above) in the two-dimensional and three-dimensional MOPs, figureFileSmall=gUF+wqCa6IANexiIXc6vcg==, figureFileBig=gheGihmg7mkXJdPROp9Zzw==, tableContent=null), ArticleFig(id=1329460826332836152, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图1, caption=候选解(五角星)在2维和3维MOPs中的支配关系, figureFileSmall=gUF+wqCa6IANexiIXc6vcg==, figureFileBig=gheGihmg7mkXJdPROp9Zzw==, tableContent=null), ArticleFig(id=1329460826525774137, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 2, caption=First two iterations of the Dividing Rectangles algorithm($ n $=2), figureFileSmall=EcX3X22h/IPEoizgjT+rUQ==, figureFileBig=gn0Mc53oVk2ZAdsLgIwtSA==, tableContent=null), ArticleFig(id=1329460826634826042, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图2, caption=Dividing Rectangles算法的前2次迭代过程($ n $=2), figureFileSmall=EcX3X22h/IPEoizgjT+rUQ==, figureFileBig=gn0Mc53oVk2ZAdsLgIwtSA==, tableContent=null), ArticleFig(id=1329460826710323515, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 3, caption=Global association mechanism, figureFileSmall=T3A7ljVkK7HX0CWnU82fbA==, figureFileBig=+VOYxvrnr0KexDtvxl12pg==, tableContent=null), ArticleFig(id=1329460828320936252, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图3, caption=全局关联机制, figureFileSmall=T3A7ljVkK7HX0CWnU82fbA==, figureFileBig=+VOYxvrnr0KexDtvxl12pg==, tableContent=null), ArticleFig(id=1329460828379656509, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 4, caption=Parallelism scheme for DEmo-DIRECT algorithm, figureFileSmall=Rr9JdSOALTrCSQiRugEkfg==, figureFileBig=4BrWEkHRl+6ffyIs/j0Bsw==, tableContent=null), ArticleFig(id=1329460828442571070, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图4, caption=DEmo-DIRECT算法的并行方案, figureFileSmall=Rr9JdSOALTrCSQiRugEkfg==, figureFileBig=4BrWEkHRl+6ffyIs/j0Bsw==, tableContent=null), ArticleFig(id=1329460828505485631, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 5, caption=PF comparison between NSGA-II and DEmo-DIRECT on ZDT1, figureFileSmall=RUzk8ol56I3JuojCzY/eRw==, figureFileBig=2CUDxvd/Y03tYmiBXzMc9A==, tableContent=null), ArticleFig(id=1329460828572594496, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图5, caption=NSGA-II与DEmo-DIRECT在ZDT1上的PF对比, figureFileSmall=RUzk8ol56I3JuojCzY/eRw==, figureFileBig=2CUDxvd/Y03tYmiBXzMc9A==, tableContent=null), ArticleFig(id=1329460828639703361, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 6, caption=PF comparison between NSGA-II and DEmo-DIRECT on ZDT2, figureFileSmall=Ja7QBOxw3OEP5JdHThKIJw==, figureFileBig=d0hzmgO0C9A2I/L05UjDHw==, tableContent=null), ArticleFig(id=1329460828698423618, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图6, caption=NSGA-II与DEmo-DIRECT在ZDT2上的PF对比, figureFileSmall=Ja7QBOxw3OEP5JdHThKIJw==, figureFileBig=d0hzmgO0C9A2I/L05UjDHw==, tableContent=null), ArticleFig(id=1329460828794892611, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 7, caption=PF comparison between NSGA-II and DEmo-DIRECT on ZDT3, figureFileSmall=ADmHwdaEndC6Hn76kti9SA==, figureFileBig=FtuOGLXZS6BPjtA4wWoNcQ==, tableContent=null), ArticleFig(id=1329460828862001476, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图7, caption=NSGA-II与DEmo-DIRECT在ZDT3上的PF对比, figureFileSmall=ADmHwdaEndC6Hn76kti9SA==, figureFileBig=FtuOGLXZS6BPjtA4wWoNcQ==, tableContent=null), ArticleFig(id=1329460828941693253, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 8, caption=PF comparison between NSGA-II and DEmo-DIRECT on ZDT6, figureFileSmall=k/Hu+uqJDjiC/oA1BB6+eg==, figureFileBig=VwvX9I3I5u7d3S2bVIHRsA==, tableContent=null), ArticleFig(id=1329460829000413510, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图8, caption=NSGA-II与DEmo-DIRECT在ZDT6上的PF对比, figureFileSmall=k/Hu+uqJDjiC/oA1BB6+eg==, figureFileBig=VwvX9I3I5u7d3S2bVIHRsA==, tableContent=null), ArticleFig(id=1329460829054939463, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 9, caption=PF comparison between NSGA-II and DEmo-DIRECT on DTLZ5, figureFileSmall=dnXCUSBV/48NLYAat6msWg==, figureFileBig=+lAqRKD5N8Q15VHmB9axPg==, tableContent=null), ArticleFig(id=1329460829122048328, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图9, caption=NSGA-II与DEmo-DIRECT在DTLZ5上的PF对比, figureFileSmall=dnXCUSBV/48NLYAat6msWg==, figureFileBig=+lAqRKD5N8Q15VHmB9axPg==, tableContent=null), ArticleFig(id=1329460829176574281, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 10, caption=HV metric values of pDEmo-DIRECT at different parallel scales, figureFileSmall=DRHmCRRHp5r7ZpqL7OvcaA==, figureFileBig=gSIqiq6/5jUojOuzRGx6tg==, tableContent=null), ArticleFig(id=1329460829239488842, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图10, caption=不同并行规模下pDEmo-DIRECT的HV指标值, figureFileSmall=DRHmCRRHp5r7ZpqL7OvcaA==, figureFileBig=gSIqiq6/5jUojOuzRGx6tg==, tableContent=null), ArticleFig(id=1329460829327569227, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 11, caption=HV metric values of pDEmo-DIRECT without adaptive association migration strategy, figureFileSmall=Fhl35MGBXHeeqJnSSNiaNA==, figureFileBig=l4eewdmX1h+Ifb3nf7N8CA==, tableContent=null), ArticleFig(id=1329460829386289484, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图11, caption=未使用自适应关联迁移策略的 pDEmo-DIRECT的HV指标值, figureFileSmall=Fhl35MGBXHeeqJnSSNiaNA==, figureFileBig=l4eewdmX1h+Ifb3nf7N8CA==, tableContent=null), ArticleFig(id=1329460829461786957, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Figure 12, caption=Speedup of pDEmo-DIRECT under different parallel scales, figureFileSmall=SO15cAVIQvh5+cu65YBwxQ==, figureFileBig=vs8NVKNhTjsh5VfvqcUETA==, tableContent=null), ArticleFig(id=1329460829520507214, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=图12, caption=pDEmo-DIRECT在不同并行规模下的加速比, figureFileSmall=SO15cAVIQvh5+cu65YBwxQ==, figureFileBig=vs8NVKNhTjsh5VfvqcUETA==, tableContent=null), ArticleFig(id=1329460829579227471, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=EN, label=Table 1, caption=

Performance Metrics Comparison Between NSGA-II and DEmo-DIRECT (Ours)

, figureFileSmall=null, figureFileBig=null, tableContent=
测试用例GDIGDHV
NSGA-IIDEmo-DIRECTNSGA-IIDEmo-DIRECTNSGA-IIDEmo-DIRECT
ZDT15.147E−3(2.4E−8)3.829E−3(-)2.237E−3(2.8E−8)1.777E−3(-)5.940E−1(9.4E−9)6.642E−1(-)
ZDT24.203E−3(1.6E−8)3.875E−3(-)2.515E−3(2.5E−8)1.744E−3(-)2.584E−1(2.5E−9)3.309E−1(-)
ZDT36.198E−3(3.0E−8)3.847E−3(-)2.823E−3(2.8E−8)3.894E−3(-)1.043E+0(1.7E−9)1.042E−0(-)
ZDT68.233E−3(3.7E−9)3.443E−3(-)2.777E−3(1.5E−8)1.095E−3(-)1.681E−1(9.6E−9)3.229E−1(-)
DTLZ54.093E−3(3.4E−9)3.861E−3(-)2.726E−3(7.0E−9)2.126E−3(-)1.983E−1(1.2E−9)2.213E−1(-)
), ArticleFig(id=1329460829684085072, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, language=CN, label=表1, caption=

NSGA-II和DEmo-DIRECT(本文)的性能指标对比

, figureFileSmall=null, figureFileBig=null, tableContent=
测试用例GDIGDHV
NSGA-IIDEmo-DIRECTNSGA-IIDEmo-DIRECTNSGA-IIDEmo-DIRECT
ZDT15.147E−3(2.4E−8)3.829E−3(-)2.237E−3(2.8E−8)1.777E−3(-)5.940E−1(9.4E−9)6.642E−1(-)
ZDT24.203E−3(1.6E−8)3.875E−3(-)2.515E−3(2.5E−8)1.744E−3(-)2.584E−1(2.5E−9)3.309E−1(-)
ZDT36.198E−3(3.0E−8)3.847E−3(-)2.823E−3(2.8E−8)3.894E−3(-)1.043E+0(1.7E−9)1.042E−0(-)
ZDT68.233E−3(3.7E−9)3.443E−3(-)2.777E−3(1.5E−8)1.095E−3(-)1.681E−1(9.6E−9)3.229E−1(-)
DTLZ54.093E−3(3.4E−9)3.861E−3(-)2.726E−3(7.0E−9)2.126E−3(-)1.983E−1(1.2E−9)2.213E−1(-)
)], attaches=null, journal=Journal(id=1324759606947315908, delFlag=0, nameCn=计算机研究与发展, nameEn=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, issn=1000-1239, eissn=null, cn=11-1777/TP, coden=null, periodic=0, language=CN, oaType=null, ccby=null, superviseOffice=null, ownerOffice=null, pubOffice=null, editorOffice=null, officeType=null, aims=null, clcCode=null, officeProv=null, officeCity=null, officeAddr=null, officeZip=null, officeEmail=null, officePhone=null, editDirector=null, officeDirector=null, officeDirectorPhone=null, officeStaffNum=null, officeEmpNum=null, coverPicUrl=k2l8zgqwstuxxevFX2qxVA==, journalPrice=null, startedYear=null, abbrevIsoEn=Journal of Computer Research and Development, journalRemark=null, publicationField=null, createdTime=1793776903141, updatedTime=1793850698612, createdBy=18614031015, updatedBy=13701087609, firstLetterCn=J, firstLetterEn=J, subjectCode=Electronic Information, subjectName=null, subjectCodeEn=Electronic Information, subjectNameEn=null, picCn=k2l8zgqwstuxxevFX2qxVA==, picEn=r6k0Ry+RD+c/VXj5QarmDw==, jcr=null, cjcr=null, exts=[JournalExt(id=1325069127710286688, language=CN, name=计算机研究与发展, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698640, updatedTime=1793850698640, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""}), JournalExt(id=1325069127777395553, language=EN, name=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698656, updatedTime=1793850698656, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""})], databaseList=null, tenantJournalId=1324759914146529478, websiteList=[Website(id=1325070300139892771, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN, language=CN, createTime=1793850978169, createBy=18614031015, updateTime=1793851040259, updateBy=18614031015, name=计算机研究与发展-中文, tplId=1146099689490845704, title=计算机研究与发展, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070893751349360, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=articleTextType, value=kx, createTime=1793851119697, updateTime=1793851119697, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893730377837, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=banner, value=null, createTime=1793851119692, updateTime=1793851119692, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893772320883, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=grayFlag, value=0, createTime=1793851119702, updateTime=1793851119702, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893721989228, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851119690, updateTime=1793851119690, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893784903797, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=minRunFlag, value=0, createTime=1793851119705, updateTime=1793851119705, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893742960751, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic, createTime=1793851119695, updateTime=1793851119695, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893780709492, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=silenceFlag, value=0, createTime=1793851119704, updateTime=1793851119704, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893738766446, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1793851119694, updateTime=1793851119694, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893755543665, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeColor, value=null, createTime=1793851119698, updateTime=1793851119698, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893763932274, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeStyle, value=null, createTime=1793851119700, updateTime=1793851119700, creator=18614031015, updator=18614031015)]), Website(id=1325070300580294698, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN, language=EN, createTime=1793850978274, createBy=18614031015, updateTime=1793851036638, updateBy=18614031015, name=计算机研究与发展-英文, tplId=1146101810881728533, title=Journal of Computer Research and Development, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070925288321148, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=articleTextType, value=kx, createTime=1793851127216, updateTime=1793851127216, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925263155321, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=banner, value=null, createTime=1793851127210, updateTime=1793851127210, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925309292671, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=grayFlag, value=0, createTime=1793851127221, updateTime=1793851127221, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925254766712, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851127208, updateTime=1793851127208, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925326069889, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=minRunFlag, value=0, createTime=1793851127225, updateTime=1793851127225, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925279932539, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic, createTime=1793851127214, updateTime=1793851127214, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925317681280, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=silenceFlag, value=0, createTime=1793851127223, updateTime=1793851127223, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925271543930, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_en_623/, createTime=1793851127212, updateTime=1793851127212, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925292515453, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeColor, value=null, createTime=1793851127217, updateTime=1793851127217, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925300904062, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeStyle, value=null, createTime=1793851127219, updateTime=1793851127219, creator=18614031015, updator=18614031015)])], journalTitle=计算机研究与发展, weixinUrl=null, journalUrl=https://crad.ict.ac.cn/, iacademicId=null, status=1, seqNo=null, journalTitleEn=Journal of Computer Research and Development, journalPhotoCn=k2l8zgqwstuxxevFX2qxVA==, journalPhotoEn=r6k0Ry+RD+c/VXj5QarmDw==, journalFirstLetter=J, journalRecommend=null, journalNew=null, journalCollection=null, jcrJf=null, cjcrJf=null, jcrJfStr=null, cjcrJfStr=null, submissionFirstDecision=null, sciSubjectClassification=null, casSubjectClassification=null, citeScore=null, totalCitationFrequency=null, icpCode=null, psCode=null, advertisingLicenseCode=null, copyrightInformation=null, country=null, option=, provinceCode=null, provinceName=null, collectFlag=false, interPubPlatform=, interPubPlatformUrl=null), detailUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202330093, detailUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202330093, pdfUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/PDF/10.7544/issn1000-1239.202330093, pdfUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/PDF/10.7544/issn1000-1239.202330093, aliStartDate=0, aliEndDate=0, collectionFlag=false, citedCount=null, citedUrl=null, previewStatus=0, delFlag=0, hasFullText=1, orderTime=1730390400000, fullTextJson=null, articleText=null, reference=null)
收藏切换
基于归一分解的并行多目标Dividing Rectangles算法
李晨 1 , 陈逸东 1, 2 , 陆忠华 1 , 杨雪莹 1, 2 , 王子田 3 , 迟学斌 1
计算机研究与发展 | 人工智能 2024,61(11): 2909-2922
收起
收藏切换
计算机研究与发展 |人工智能 2024 , 61 (11) : 2909 -2922
基于归一分解的并行多目标Dividing Rectangles算法
全屏
[Author(id=1329460823925305614, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=lichen@sccas.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824009191696, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460823925305614, language=EN, stringName=Chen Li, firstName=Chen, middleName=null, lastName=Li, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

"}, bioImg=null, bioContent=

born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824097272081, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460823925305614, language=CN, stringName=李晨, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"GQ9LANpiHCxCoLNL4JKvJQ==","content":"

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

"}, bioImg=GQ9LANpiHCxCoLNL4JKvJQ==, bioContent=

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])]), Author(id=1329460824202129683, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=chenyidong@cnic.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824332153110, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824202129683, language=EN, stringName=Yidong Chen, firstName=Yidong, middleName=null, lastName=Chen, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083
2University of Chinese Academy of Sciences, Beijing 100049, bio={"content":"

born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

"}, bioImg=null, bioContent=

born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824466370839, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824202129683, language=CN, stringName=陈逸东, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1中国科学院计算机网络信息中心 北京 100083
2中国科学院大学 北京 100049, bio={"img":"vo/k5ggJ3RSbuP7JnaQj7Q==","content":"

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

"}, bioImg=vo/k5ggJ3RSbuP7JnaQj7Q==, bioContent=

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)]), AuthorCompany(id=1329460822226612487, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=2, ext=[AuthorCompanyExt(id=1329460822235001096, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2University of Chinese Academy of Sciences, Beijing 100049), AuthorCompanyExt(id=1329460822243389705, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2中国科学院大学 北京 100049)])]), Author(id=1329460824525091097, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=zhlu@cnic.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824592199963, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824525091097, language=EN, stringName=Zhonghua Lu, firstName=Zhonghua, middleName=null, lastName=Lu, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

"}, bioImg=null, bioContent=

born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824650920220, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824525091097, language=CN, stringName=陆忠华, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"u44VrNO1uvwCiJrMqRjlHg==","content":"

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

"}, bioImg=u44VrNO1uvwCiJrMqRjlHg==, bioContent=

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])]), Author(id=1329460824709640478, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=3, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824780943649, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824709640478, language=EN, stringName=Xueying Yang, firstName=Xueying, middleName=null, lastName=Yang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083
2University of Chinese Academy of Sciences, Beijing 100049, bio={"content":"

born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

"}, bioImg=null, bioContent=

born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460824873218338, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824709640478, language=CN, stringName=杨雪莹, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, 2, address=1中国科学院计算机网络信息中心 北京 100083
2中国科学院大学 北京 100049, bio={"img":"rxLDiAdQi9/WekLAOCV9BA==","content":"

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

"}, bioImg=rxLDiAdQi9/WekLAOCV9BA==, bioContent=

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)]), AuthorCompany(id=1329460822226612487, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=2, ext=[AuthorCompanyExt(id=1329460822235001096, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2University of Chinese Academy of Sciences, Beijing 100049), AuthorCompanyExt(id=1329460822243389705, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822226612487, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=2中国科学院大学 北京 100049)])]), Author(id=1329460824936132900, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=4, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=wzt@aihpc.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460824999047462, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824936132900, language=EN, stringName=Zitian Wang, firstName=Zitian, middleName=null, lastName=Wang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=3, address=3Beijing AIHPC Co., Ltd., Beijing 100037, bio={"content":"

born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

"}, bioImg=null, bioContent=

born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460825053573415, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460824936132900, language=CN, stringName=王子田, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=3, address=3北京智速科技有限公司 北京 100037, bio={"img":"eFZdd5aLpl6TtyKbWsc/tA==","content":"

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

"}, bioImg=eFZdd5aLpl6TtyKbWsc/tA==, bioContent=

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460823845613834, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=3, ext=[AuthorCompanyExt(id=1329460823854002443, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3Beijing AIHPC Co., Ltd., Beijing 100037), AuthorCompanyExt(id=1329460823862391052, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460823845613834, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=3北京智速科技有限公司 北京 100037)])]), Author(id=1329460825137459497, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, orderNo=5, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=chi@sccas.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329460825212956971, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460825137459497, language=EN, stringName=Xuebin Chi, firstName=Xuebin, middleName=null, lastName=Chi, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083, bio={"content":"

born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

"}, bioImg=null, bioContent=

born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329460825288454444, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, authorId=1329460825137459497, language=CN, stringName=迟学斌, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=1, address=1中国科学院计算机网络信息中心 北京 100083, bio={"img":"2cbTqABE4Ny3rQuVZ3fT3g==","content":"

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

"}, bioImg=2cbTqABE4Ny3rQuVZ3fT3g==, bioContent=

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329460822142726404, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, xref=1, ext=[AuthorCompanyExt(id=1329460822146920709, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083), AuthorCompanyExt(id=1329460822159503622, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329460817042452701, companyId=1329460822142726404, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=1中国科学院计算机网络信息中心 北京 100083)])])]
李晨1 , 陈逸东1, 2 , 陆忠华1 , 杨雪莹1, 2, 王子田3 , 迟学斌1
作者信息
  • 1中国科学院计算机网络信息中心 北京 100083
  • 2中国科学院大学 北京 100049
  • 3北京智速科技有限公司 北京 100037
作者简介:

1993年生. 博士,助理研究员. CCF会员. 主要研究方向为高性能计算、多目标优化、模糊计算

1996年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

1965年生. 博士,研究员,博士生导师. CCF高级会员. 主要研究方向为高性能计算及其应用

1997年生. 博士研究生. 主要研究方向为高性能计算技术在计算金融中的应用

1982年生. 博士. 主要研究方向为高性能计算、多目标优化

1963年生. 博士,研究员,博士生导师. CCF杰出会员. 主要研究方向为高性能计算、网格技术

A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition
Chen Li1 , Yidong Chen1, 2 , Zhonghua Lu1 , Xueying Yang1, 2, Zitian Wang3 , Xuebin Chi1
Affiliations
  • 1Computer Network Information Center, Chinese Academy of Sciences, Beijing 100083
  • 2University of Chinese Academy of Sciences, Beijing 100049
  • 3Beijing AIHPC Co., Ltd., Beijing 100037
  • born in 1993. PhD, assistant professor. Member of CCF. Her main research interests include high performance computing, multi-objective optimization, and fuzzy computing

    born in 1996. PhD candidate. His main research interest includes high performance computing technology in the computational finance. ()

    born in 1965. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interest includes high performance computing and its application. ()

    born in 1997. PhD candidate. Her main research interest includes high performance computing technology in the computational finance. ()

    born in 1982. PhD. His main research interests include high performance computing and multi-objective optimization. ()

    born in 1963. PhD, professor, PhD supervisor. Distinguished member of CCF. His main research interests include high performance computing and grid technology. ()

出版时间: 2024-11-01 doi: 10.7544/issn1000-1239.202330093
文章导航
收藏切换

多目标优化问题普遍存在且难以解决,目前多采用多目标进化算法进行求解. 然而,这些方法通常在种群初始化阶段和进化过程中包含随机操作以保持多样性,导致了其结果不可复现且缺乏全局收敛的理论保证. 鉴于此,提出了一种基于归一分解的多目标Dividing Rectangles(DIRECT)算法,首先通过一种可较好捕捉复杂前沿的归一分解方法将原问题分解为一系列子问题,以降低问题计算复杂度;其次,采用Dividing Rectangles算法同时优化分解得到的子问题,并在优化过程中基于全局关联机制将生成的候选解分配给相应的子问题,以更好地保留优秀候选解并提高算法搜索效率;最后,证明了算法的收敛性. 此外,为了进一步提高计算效率,提出了一种基于自适应关联迁移策略的多层次多粒度并行方案,并基于该方案对所提出的算法进行了并行化. 将所提算法应用于多个基准优化问题,实验结果表明,相比于NSGA-II,所提串行算法能够产生收敛性、多样性更为优越的帕累托最优解集,并行算法可在大规模缩短问题求解时间的同时,进一步提升帕累托前沿近似精度.

多目标优化  /  目标空间分解  /  Dividing Rectangles算法  /  并行计算  /  全局优化

Multi-objective optimization problems are common in real-world applications. However, the high computational complexity severely hinders their solution. Currently, multi-objective evolutionary algorithms are mostly used for their solving. Nevertheless, these methods usually contain random operations in the process of population initialization and evolution to maintain diversity, which leads to non-reproducibility and lacking the theoretical guarantee of global convergence. Therefore, a novel multi-objective Dividing Rectangles(DIRECT) algorithm is introduced based on decomposition strategy. In this algorithm, the original problem is decomposed into a series of subproblems by a normalized decomposition method that can better capture the complex frontier to reduce the computational complexity of the problem. Meanwhile, the Dividing Rectangles algorithm is used to simultaneously optimize the decomposed subproblems, and the generated candidate solutions are assigned to the corresponding subproblems based on the global association mechanism in the optimization process to better retain the good candidate solutions and improve the algorithm search efficiency. Finally, the convergence of the algorithm is demonstrated. To further improve the computational efficiency, a multi-level and multi-granularity parallel scheme based on the adaptive associative migration strategy is proposed, based on which the proposed algorithm is parallelized. Furthermore, the proposed algorithm and its parallel version are applied to several benchmark optimization problems, and the experimental results show that the proposed algorithm can obtain a Pareto set with better convergence and diversity than NSGA-II, and the parallel version can further improve the accuracy of Pareto frontier approximation while massively reducing the problem-solving time.

multi-objective optimization  /  objective space decomposition  /  Dividing Rectangles algorithm  /  parallel computing  /  global optimization
李晨, 陈逸东, 陆忠华, 杨雪莹, 王子田, 迟学斌. 基于归一分解的并行多目标Dividing Rectangles算法. 计算机研究与发展, 2024 , 61 (11) : 2909 -2922 . DOI: 10.7544/issn1000-1239.202330093
Chen Li, Yidong Chen, Zhonghua Lu, Xueying Yang, Zitian Wang, Xuebin Chi. A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition[J]. Journal of Computer Research and Development, 2024 , 61 (11) : 2909 -2922 . DOI: 10.7544/issn1000-1239.202330093
多目标优化旨在同时优化2个或2个以上相互冲突的目标,在许多科学和工程问题中均有重要应用. 例如,在投资组合选择中,投资者往往期望在较低风险水平下获得更高收益. 然而收益的提升往往伴随着风险的增加,这意味着这2个目标在本质上是矛盾的. 此时的投资组合选择问题便被称为一个多目标优化问题(multi-objective optimization problems, MOPs). 在解决此类问题时,无论是否存在约束,我们通常只能获得一组权衡最优解(又称帕累托最优解),而无法获得单一最优解[1].
MOPs的目标函数通常具有多峰、不连续、不可导甚至离散等特点,无法通过传统的最优化方法来解决[2]. 因此,其求解方法成为了该领域的研究热点之一. 在过去的几十年里,大量优秀的多目标优化算法被提出并成功应用,多目标进化算法(multi-objective evolutionary algorithms,MOEAs)便是目前比较流行的一类. 该类算法基于种群搜索技术模拟自然进化过程,以得到具有良好收敛性和多样性的解集,非常适用于各种复杂的MOPs [3-4]. NSGA-II [5]和MOEA/D[6]为其中最为典型的2种算法,为MOPs求解方法的后继研究[7-8]提供了坚实基础.
然而,MOEAs通常在种群初始化阶段和进化过程中包含随机操作以保持多样性,这导致了其结果不可复现且缺乏全局收敛的理论保证. 在此背景下,一些研究人员开始基于确定性优化算法实现MOPs求解. Dividing Rectangles(DIRECT)算法是由Jones等人[9]在1993年提出的高效确定性全局优化算法,可在未进行“参数调优”的情况下平衡局部和全局搜索能力,目前已在各种单目标优化问题(single objective optimization problems,SOPs)中显示出了优越性能. 近期,国内外研究人员开始探索其在MOPs上的适用性和改进方案[10]. 然而大多数基于非支配排序或HV(hypervolume)指标[11]构建. 常用的快速非支配排序算法复杂度为$ O(M{N^2}) $,其中$ M $为目标个数,$ N $为待排序点的数量[5];而计算$ d $维$ n $个非支配点的HV指标的算法复杂度下限为$ O({n^{d{\text{/3}}}}{\text{poly}}\log n) $ [12]. 可以看出,随着非支配点和目标函数数量的增多,此类算法的计算开销将迅速增长,严重阻碍了其进一步发展及应用.
此外,随着问题规模的不断扩大和复杂程度的不断增加,人们对于多目标优化算法的求解质量和运行速度都提出了更高的要求[13]. 高性能计算(high performance computing,HPC)几乎在所有的科学学科中都发挥着重要的作用,是提高算法执行速度的有效途径. 本文设计并实现了一种基于归一分解的并行多目标Dividing Rectangles算法,来求解复杂的MOPs. 本文的主要贡献包括4个方面:
1)提出了一种归一分解方法,可更好地捕捉复杂前沿的同时使得算法维护较好的空间分布性和探索能力;此外,提出了一种全局关联机制,以更好地保留优秀候选解并提高算法搜索效率.
2)基于上述分解方法和关联机制,提出了一种多目标Dividing Rectangles算法并详细给出了收敛性分析.
3)采用多层次多粒度并行的思想,将所提出的算法进行了并行化,并提出了一种自适应关联迁移策略,以解决因单个计算节点内子问题数量较少而易陷入局部最优的问题.
4)将所提算法应用于不同的2-目标和3-目标基准优化问题,并与经典多目标优化算法进行对比,验证了算法的优越性. 此外,实验结果表明,自适应关联迁移策略可提高并行算法的帕累托前沿近似精度.
多目标优化算法的发展历程可以追溯到优化研究的早期,其实质是在多个目标之间实现最佳权衡. 随着进化计算的出现,基于进化和群体智能原则的多目标优化算法(即MOEAs)开始涌现,直到今日依旧是该领域最热门的研究方向之一. 其中几种代表性算法包括:基于帕累托支配关系的NSGA-II[5],SPEA2[14],NSGA-III[7],CMPSO[15],基于分解策略的MOEA/D[6],MOEA/D-M2M[16],RVEA[17]和基于评价指标的IBEA[18],HypE[19],iR2-MOACO[20]. 特别是Deb等人[5]提出的NSGA-II,被认为是迄今为止最优秀的多目标优化算法之一. 该算法基于遗传算法进行解空间搜索并使用非支配排序机制对候选解进行排序,同时使用拥挤距离来维护解的多样性,避免过早收敛. 此外,2007年MOEA/D的提出,是多目标优化领域的另一个重大创新. 该算法基于数学规划方法将原问题分解成多个单目标优化问题,并基于进化算法进行求解,显著降低了原问题的求解难度. 尽管MOEAs已被证明对解决大规模复杂MOPs非常有效,但是该类算法通常在种群初始化阶段和进化过程中包含随机操作,使其结果不可复现且缺乏全局收敛的理论保证.
1993年,Jones等人[9]在Lipschitzian框架[21]的基础上提出了Dividing Rectangles算法,该算法不需要Lipschitz常数先验知识,大大提升了算法通用性,同时在各种SOPs中显示出了优越性能. 近期,该算法开始受到多目标优化领域学者的关注,并取得了一些研究进展. Wang等人[22]基于非支配排序和拥挤度距离提出了一种改进的Dividing Rectangles算法,并在此基础上与多目标遗传算法(multi-objective genetic algorithm,MOGA)相结合,提出了一种名为NSDIRECT-GA的多目标优化算法,使用改进的Dividing Rectangles算法来生成MOGA中的种群个体. 实验表明,相较于NSGA-II,NSDIRECT-GA可获得分布性更优的帕累托解集. Al-Dujaili等人[23]在原始Dividing Rectangles算法的基础上进行扩展,提出了MO-DIRECT. 此外,他们将MO-DIRECT与其他基于分解的多目标优化技术进行对比,验证了其优越性. Campana等人[24]通过将Dividing Rectangles算法与无梯度局部优化算法相耦合设计了一种多目标Dividing Rectangles算法,用于解决非线性约束MOPs. Wong等人[1]将HV指标引入到MO-DIRECT算法中,提出了MO-DIRECT-hv算法,通过选择具有较高HV贡献度的潜在最优超矩形(potentially-optimal hyperrectangle)来增强其搜索的多样性,同时保持算法的局部和全局搜索能力. 然而,以上算法大多数基于非支配排序或HV指标构建,随着非支配点和目标函数数量的增多,此类算法的计算开销将迅速增长,严重地阻碍了其进一步发展及应用. 此外,日渐增大的问题规模和不断提升的复杂程度对求解算法的性能提出了更高的要求,但相关的并行算法及实现技术研究薄弱.
通常,对于有$ n $个决策变量、$ m $个最小化目标的多目标优化问题$ {\text{I}} $,可以形式化描述为
$ \begin{aligned}\min F(\boldsymbol{x})=&\left(f_1(\boldsymbol{x}), f_2(\boldsymbol{x}), …, f_m(\boldsymbol{x})\right)^{\mathrm{T}}, \\\text { s.t. } \quad \boldsymbol{x}=&\left(x_1, x_2, …, x_n\right) \in \varOmega.\end{aligned}$
其中$ {\boldsymbol{x}}\in {\mathbb{R}}^{n} $称为决策向量,$ \varOmega $为可行决策空间(decision space),$ F({\boldsymbol{x}})\in {\mathbb{R}}^{m} $为目标向量.
与SOPs不同,没有一个单一的最优解可以同时优化MOPs中的所有目标[16]. 取而代之的是,通过“支配关系”来比较MOPs搜索域中的不同候选解[25]. 我们称候选解$ {\boldsymbol{a}} $支配(dominate)候选解$ {\boldsymbol{b}} $($ {\boldsymbol{a}} \prec {\boldsymbol{b}} $),当且仅当$ {f_i}({\boldsymbol{a}}) \leqslant {f_i}({\boldsymbol{b}}){\text{ }}\forall i \in \{1,{\text{2}},…,m\} $且$ F({\boldsymbol{a}}) \ne F({\boldsymbol{b}}){\text{ }} $. 候选解(如图1中五角星所示)在2维和3维问题中的支配关系如图1所示. 其中,E表示该部分区域的解与候选解互不支配,B表示该部分区域的解支配候选解,W表示该部分区域的解被候选解支配. 如果候选解$ {\boldsymbol{p}} $在搜索域中不被任何其他候选解所支配,则称其为帕累托最优(Pareto optimal),称$ F({\boldsymbol{p}}) $为帕累托最优目标向量. 决策空间$ \varOmega $上所有的帕累托最优解所构成的集合称为帕累托解集(Pareto set,PS),所有的帕累托最优目标向量组成帕累托前沿(Pareto front,PF)[26]. 能否高效率地找到尽量多的帕累托最优解逼近PF,是衡量多目标优化算法性能的标准.
Dividing Rectangles算法是一种高效的确定性单目标全局优化算法[9],在工程设计、科学研究等领域中应用广泛[27-28]. 该算法将整个决策空间看作一个超立方体,并不断地进行分割以得到新的子超矩形,直到某个限定的收敛条件(迭代的次数或分割矩形的数目等)被满足.
$ n = 2 $时,算法的前2次迭代过程如图2所示,蓝色区域为潜在最优矩形,空心点表示矩形的中心点,实心点表示新采样得到的点. 算法在每一轮按照一定的规则选择潜在最优矩形,之后确定最长边方向(可能不止1个)并在$ c \pm \delta {e_i} $处进行采样,其中,$ c $为当前潜在最优矩形的中心点,$ {e_i} $为第$ i $个最长边方向,$ \delta $是最长边长度的1/3. 随后,依次选择$ {w_i} = {\text{min}}(f(c + \delta {e_i}),f(c - \delta {e_i})) $最小的矩形的最长边方向进行3等分切割生成新矩形. 重复上述过程,直到迭代结束.
多目标Dividing Rectangles算法在每轮迭代中需要对超矩形进行评价与比较,该过程将在很大程度上影响算法的多样性和收敛性,目前多基于非支配排序与HV指标实现. 然而,这类方法计算复杂度较高,使得多目标Dividing Rectangles算法收敛速度过慢,不利于其实际应用. 因此,如何解决超矩形评价过程中的计算困难问题成为多目标Dividing Rectangles算法设计的关键.
目标空间分解技术可根据均匀分布在目标空间中的权重向量,将原问题转换为一系列与特定权重向量相关联的单目标子问题,从而显著降低算法计算复杂度,目前已被广泛应用于多目标优化领域[29-30]. 常用的分解方法有加权和法(weighted sum approach, WS)、切比雪夫法(Tchebycheff approach,Tch)和边界交叉法(boundary intersection approach,BI)[31]. 然而,以上方法大多对前沿形状十分敏感,在捕捉凸形、凹形或陡峭等复杂前沿时,难以同时维护较好的空间分布性和探索能力[30]. 在本文中,我们提出了一种归一分解方法,使算法在保持多样性的同时可更快更好地收敛到PF. 由该方法得到的子问题的数学表达式为:
$ \begin{aligned} &\mathrm{min}\;{g}^{\text{sbi}}\left({\boldsymbol{x}}|{\boldsymbol{\lambda}} ,{{\boldsymbol{z}}}_{\text{ref}}\right)={d}_{2},\\ &\text{s}\text{.t}\text{. }{d}_{1}=\dfrac{\Vert {\left(F({\boldsymbol{x}})-{{\boldsymbol{z}}}_{\text{ref}}\right)}^{\text{T}}{\boldsymbol{\lambda}} \Vert }{\Vert {\boldsymbol{\lambda}} \Vert },\\ &\quad\;\;{d}_{2}=\dfrac{{d}_{1}-{d}_{1}^{\mathrm{min}}}{{d}_{1}^{\mathrm{max}}-{d}_{1}^{\mathrm{min}}}. \end{aligned} $
其中:$ {\boldsymbol{x}} $和$ F({\boldsymbol{x}}) $分别为原问题的决策向量和目标向量;$ {\boldsymbol{\lambda }} = \left( {{\lambda _1},{\lambda _2}, …,{\lambda _m}} \right) $为预先生成的权重向量,对于$ \forall s \in \{1,{\text{2,}} …,m\},{\text{ }}{\lambda _s} > 0 $且$ \sum\limits_{s = 1}^m {{\lambda _s}} = 1 $,$ m $为原问题目标数量;$ {{\boldsymbol{z}}_{{\text{ref}}}} = \left( {{z_1},{z_2}, …,{z_m}} \right) $为参考点,$ {z_k} $是当前目标$ k $方向上的最优值. $ d_1^{\max } $和$ d_1^{\min } $分别为当前$ {\boldsymbol{\lambda }} $方向上投影最大值和最小值.
权重向量作为归一分解方法的前提,其生成方式至关重要. 不同的权重向量会得到不同的子问题集合,进而得到不同的帕累托最优解. 为了得到均匀分布的帕累托最优解,需要产生1组在目标空间内均匀分布的权重向量$ {{{\boldsymbol{\lambda }}^1},{{\boldsymbol{\lambda }}^2}, …,{{\boldsymbol{\lambda }}^N}} $($ N $为权重向量数目),具体方式描述为:
$ \begin{array}{c}{\displaystyle \sum _{s=1}^{m}{\lambda }_{s}^{i}}=1,\end{array} $
$ \begin{array}{c}{ \lambda }_{s}^{i}\in \left\{\dfrac{0}{H},\dfrac{1}{H},…,\dfrac{H}{H}\right\},\end{array} $
其中$ H $为预先设置的一个正整数. 该方法可保证$ N $个权重向量都落在一个平面上. 此外,$ N = {{\mathrm{C}}} _{H + m - 1}^{m - 1} $.
通过归一分解方法,问题$ {\text{I}} $可被转换为数学形式为式(2)的$ N $个单目标子问题:
$ \left\{\begin{array}{c}\min g^{\mathrm{sbi}}\left(\boldsymbol{x} \mid {\boldsymbol{\lambda}}^1, \boldsymbol{z}_{\mathrm{ref}}\right), \\\min g^{\mathrm{sbi}}\left(\boldsymbol{x} \mid {\boldsymbol{\lambda}}^2, \boldsymbol{z}_{\mathrm{ref}}\right), \\\vdots \\\min g^{\mathrm{sbi}}\left(\boldsymbol{x} \mid {\boldsymbol{\lambda}}^N, \boldsymbol{z}_{\mathrm{ref}}\right).\end{array}\right. $
通过对$ N $个子问题进行优化,可得到问题$ {\text{I}} $可达目标集左下边界(PF是其一部分)与从参考点发出的一组直线的交点,形成对整个PF的良好近似.
如何将产生的候选解与子问题关联起来同样是影响算法效率的关键环节. 不合理的关联机制会错误地淘汰优秀候选解,严重影响收敛速度.
为了解决上述问题,本文提出一种全局关联机制,将从所有子问题中全局地挑选一个与后代个体最匹配的子问题进行关联. 具体地,将参考点到候选解的向量在权重向量$ {{\boldsymbol{\lambda }}^i} $上的投影值作为度量候选解与第$ i $个子问题之间的关联度,投影值越小关联度越大. 选择与该候选解关联度最大的子问题进行关联. 如图3所示,相较于权重向量2,参考点到候选解$ {{\boldsymbol{x}}^i} $的向量在权重向量1上的投影值更小,因此候选解$ {{\boldsymbol{x}}^i} $被关联到了子问题1.
基于以上分解方法与关联机制,本文提出了一种多目标Dividing Rectangles算法(简称DEmo-DIRECT),用于处理复杂MOPs. 该算法基于归一分解方法将原始问题转换为$ N $个子问题,采用Dividing Rectangles算法同时优化这$ N $个子问题,并在优化过程中基于全局关联机制将生成的候选解分配给相应的子问题,最终形成对问题PF的有效近似,算法框架如算法1所示.
算法1. DEmo-DIRECT算法.
输入:最大迭代次数$ T $,正数$ tol $;
输出:帕累托集PS.
① 产生$ N $个权重向量$ {{{\boldsymbol{\lambda }}^1},{{\boldsymbol{\lambda }}^2}, …,{{\boldsymbol{\lambda }}^N}} $;
② 设置参考点$ {{\boldsymbol{z}}_{{\text{ref}}}} $;
③ 将决策空间归一化为一个超立方体$ \hbar $,设$ {{\boldsymbol{c}}_1} $为 超立方体的中心点并计算$ {g^{{\text{sbi}}}}\left( {{{\boldsymbol{c}}_1}} \right) $;
④ 令$ {S_0} = \hbar $,$ t = 0 $,$ r = 1 $;
⑤ while $ t < T $ do
⑥  基于相应选择策略生成潜在最优超矩形集 合$ {I_t} $,其个数为$ \tilde r $;
⑦  $ {S_t} \leftarrow {S_t} - {I_t} $;
⑧  $ r = r - \tilde r $;
⑨  for $ i \leftarrow 1{\text{ to }}\tilde r $ do
⑩   令潜在最优超矩形$ i $的每个最长边$ {{\boldsymbol{c}}_i} \pm {\delta _i}{e_k} $ 处的点为新采样点;
⑪   计算所有新采样点的目标向量;
⑫  end for
⑬  更新$ {{\boldsymbol{z}}_{{\text{ref}}}} $;
⑭  while $ {I_t} \ne \varnothing $ do
⑮   选择一个潜在最优超矩形$ j $;
⑯   将其新采样点与子问题相关联;
⑰   更新子问题的最大、最小投影值;
⑱   计算所有新采样点的$ {g^{{\text{sbi}}}} $;
⑲   对超矩形$ j $的每个最长边,计算$ {w_k} = $ $ {\text{min}} ({g^{{\text{sbi}}}}({{\boldsymbol{c}}_j} + {\delta _j}{e_k}){g^{{\text{sbi}}}}({{\boldsymbol{c}}_j} - {\delta _j}{e_k})) $;
⑳   依次选择$ {w_k} $最小的方向对超矩形所有最长 边进行3等分;
㉑    $ {I_t} \leftarrow {I_t} - \left\{ j \right\} $;
㉒  end while
㉓  $ {S}_{t+1}\leftarrow {S}_{t}\cup \left\{新生成超矩形\right\} $;
㉔  $ r=r+新生成超矩形个数 $;
㉕   $ t = t + 1 $;
㉖ end while
㉗ 选择$ {g^{{\text{sbi}}}} < tol $的超矩形以形成PS;
㉘ return PS.
在初始化阶段,DEmo-DIRECT算法将解空间规范化为一个超矩形,并生成参考点$ {{\boldsymbol{z}}_{{\text{ref}}}} $与$ N $个权重向量. 之后,将迭代地识别和分割潜在最优超矩形,直到达到最大迭代次数. 在这个过程中,算法将根据如下策略选择潜在的最优超矩形.
选择策略:假设当前已存在$ r $个超矩形,如果存在某个常数$ \widetilde K $,使得第$ j $个超矩形满足式(5),则对应的超矩形被称为潜在最优超矩形.
$ \begin{array}{l}{g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{j}\right)-\tilde{K}{d}_{j}\le {g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{i}\right)-\tilde{K}{d}_{i},\text{ }i=1,2,…,r,\\ {g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{j}\right)-\tilde{K}{d}_{j}\le {g}_{\text{min }}^{\text{sbi}}-\epsilon \left|{g}_{\text{min }}^{\text{sbi}}\right|,\end{array} $
其中$ {{\boldsymbol{c}}_j} $为第$ j $个超矩形的中心,$ {d_j} $为第$ j $个超矩形中心到其顶点的距离,$ \epsilon $为任意正常数,$ g_{{\text{min }}}^{{\text{sbi}}} $是当前最优$ {g^{{\text{sbi}}}} $值.
之后,算法1将在所有潜在最优超矩形的所有最长边的$ {{\boldsymbol{c}}_i} \pm {\delta _i}{e_k} $处进行采样,并按照$ {w_k} $从小到大的顺序对最长边进行3等分. 最终,算法选择$ {g^{{\text{sbi}}}} < tol $的超矩形,形成帕累托集$ {\text{PS}} $.
在DEmo-DIRECT中,具备相同$ {g^{{\text{sbi}}}} $值和对角线长度的超矩形将有同样的机会被选为潜在最优矩形,即使它们相关联的子问题不同. 也就是说,算法在实现潜在最优超矩形选择时,可同时兼顾多个参考方向上的子问题. 即使当前已求解点集中于少数几个权重方向,由于算法具有优秀的全局探索能力,一旦发现新的权重方向上的解,将能保证在新一轮迭代过程中对相关子问题实现进一步搜索.
若MOP的目标函数是连续的,或至少在其PF附近是连续的,则DEmo-DIRECT算法可在理论上保证收敛到该问题的PF,具体证明如下.
引理1.当迭代次数$ t \to \infty $时,DEmo-DIRECT算法生成的所有超矩形的最少分割次数$ D(t) \to \infty $.
证明. 如果$ \mathop {\lim }\limits_{t \to \infty } D(t) < \infty $,那么一定存在一些迭代步$ t' $,使得该步之后$ D(t) $将不再增加,即$ \mathop {\lim }\limits_{t \to \infty } D(t) = D\left( {t'} \right) $. 假设在迭代步$ t' $结束时,$ {S_{ t'}} $中有有限($ P $)个超矩形的分割次数为$ D\left( {t'} \right) $,那么这些超矩形具有最大的中心到顶点的距离. 设超矩形$ j $的$ {g^{{\text{sbi}}}} $值最小,由于对$ \forall i = 1,2, …,r $,皆有$ \left( {{d_j} - {d_i}} \right) \geqslant 0 $,则根据3.3节中的选择策略可知,一定存在$ \widetilde K $同时满足
$ \begin{array}{l}\tilde{K}\left({d}_{j}-{d}_{i}\right)\ge {g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{j}\right)-{g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{i}\right),\text{ }i=1,2,…,r,\\ \tilde{K}\ge \dfrac{{g}^{\text{sbi}}\left({{\boldsymbol{c}}}_{j}\right)-{g}_{\text{min }}^{\text{sbi}}+\epsilon \left|{g}_{\text{min }}^{\text{sbi}}\right|}{{d}_{j}},\end{array} $
则在$ t' + 1 $次迭代时,超矩形$ j $将成为潜在最优超矩形,继而被分割. 同理,其余$ P - 1 $个超矩形也都将在$ t' + P $代之内被划分. 这意味着$ D\left( {t' + P} \right) \geqslant D\left( {t'} \right) + 1 $,与$ \mathop {\lim }\limits_{t \to \infty } D(t) = D\left( {t'} \right) $假设相矛盾. 因此,$ \mathop {\lim }\limits_{t \to \infty } D(t) = \infty $成立. 证毕.
定理1. 若MOP的目标函数是连续的,或至少在其PF附近是连续的,当迭代次数$ t \to \infty $时,DEmo-DIRECT算法将收敛于该问题的PF.
证明. 由于新的超矩形是沿着最长边方向3等分的,则超矩形边的长度皆为$ {3^{ - y}} $,$ y $为非负整数,且长度为$ {3^{ - y}} $的边被分割完之前,长度为$ {3^{ - (y + 1)}} $的边无法被分割. 因此,经过$ D(t) $次划分后,超矩形将有$ D(t){\text{ mod }}n $条长度为$ {3^{ - (y + 1)}} $的边和$ n - D(t){\text{ mod }}n $条长度为$ {3^{ - y}} $的边,其中$ y = (D(t){\text{ }} - D(t){\text{ mod }}n)/n $,$ n $为决策变量数. 则超矩形从中心到顶点的距离为
$ d=[(D(t)\;\mathrm{mod}\;n){3}^{-2(y+1)}+(n-{D(t)\;\mathrm{mod}\;n){3}^{-2y}]}^{0.5}/2. $
从引理1中可知:$ \mathop {\lim }\limits_{t \to \infty } D(t) = \infty $. 因此,随着迭代次数$ t \to \infty $,超矩形从中心到顶点的距离为0. 那么,对于任一$ \delta > 0 $,都存在一正整数$ T $,使得在$ t > T $次迭代后存在的所有超矩形的中心到顶点的距离都小于$ \delta $. 换句话说,超立方体中的任一点$ {\boldsymbol{x}} $最终都将位于DEmo-DIRECT的某个采样点的$ \delta $距离内,即DEmo-DIRECT在所有迭代过程中采样的点形成了初始超立方体的密集子集. 因此,只要MOP的目标函数在其PF附近是连续的,则$ {g^{{\text{sbi}}}} $便在全局最小值的邻域内连续,DEmo-DIRECT算法便可以收敛到所有子问题的全局最优函数值,进而收敛到原始问题的PF. 证毕.
随着现代计算科学的进步,现实科学与工程实践中存在的MOPs多以大量的决策变量、目标和昂贵的评估函数为特征,使得其计算复杂度进一步提升,计算时间将成为实际应用瓶颈. 为了满足实际应用需求,且更好地利用当前多处理器节点集群体系结构,本文基于MPI+OpenMP混合编程模型对DEmo-DIRECT算法实现多层次多粒度并行,在缩短问题求解时间的同时进一步提升PF近似精度.
由于DEmo-DIRECT算法是通过同时优化不同的子问题来形成对问题PF的有效近似,且更新机制具有明显的局部性,所以可在子问题间采用粗粒度并行,将不同的子问题分配到不同的计算节点上进行计算. 所有求出的解聚合到一起就构成了完整的PF. 在节点内部,为了进一步利用其多核或众核资源,可将子问题优化过程中计算量较大的任务继续分解,分配给不同的计算核心去执行.
子问题间粗粒度并行虽然加快了算法的执行速度,但相比所有子问题同时优化而言,单个计算节点内子问题数量较少,规避了不同的解引导转移搜索方向的情况,易陷入局部最优. 为了解决上述问题,本文提出了一种自适应关联迁移策略.
将该策略中对算法在通信开销、稳定性、可扩展性和准确性等方面具有较大影响的因素描述如下:
1)迁移频率
为了更好地保留原问题帕累托解集的多样性,理想的迁移应每代进行,但频繁迁移会带来过高的通信开销. 本文提出了一种多样性指标DN(diversity in node),并基于该指标对节点内个体的多样性进行评判,进而确定是否进行迁移. DN指标定义为
$ DN={\displaystyle \sum _{i=1}^{n}\left|{g}_{i}^{\text{sbi}}-{g}_{\text{min}}^{\text{sbi}}-{\displaystyle \sum _{j=1}^{n}\left({g}_{j}^{\text{sbi}}-{g}_{\text{min}}^{\text{sbi}}\right)}/n\right|}, $
其中$ n $为节点内个体(潜在最优超矩形)总数. DN小于预定的阈值时,节点内多样性不足,需要进行个体替换,由此实现自适应迁移,以避免不必要的通信开销.
2)迁出个体选择策略
不同于一般迁移策略中选择节点内较优的个体(潜在最优超矩形),本文基于全局关联机制进行迁出个体选择. 定义节点内个体$ {\boldsymbol{x}} $与其相邻节点的关联度为
$ Co({\boldsymbol{x}},Nei)={\displaystyle \sum _{{\boldsymbol{\lambda}} \in Nei}\frac{\Vert {\left(F({\boldsymbol{x}})-{{\boldsymbol{z}}}_{\text{ref}}\right)}^{\text{T}}{\boldsymbol{\lambda}} \Vert }{\Vert {\boldsymbol{\lambda}} \Vert }}, $
其中Nei为邻居节点中所有子问题的权重向量集合. 本文将选择Co值最大的若干个个体作为迁出个体.
基于MPI+OpenMP混合编程模型,我们给出了DEmo-DIRECT算法的基于自适应关联迁移策略的多层次多粒度并行方案,具体如图4所示(以3节点为例).
现将算法并行方案说明如下. 启动$ m $个MPI进程,由0号进程初始化$ N $个权重向量,并基于欧氏距离对其进行排序. 随后,使用函数MPI_Scatter将排序好的权重向量平均地划分给各个进程. 每个MPI进程同时优化与权重向量相关的$ N/m $个子问题,并采用点对点的方式与其邻居进程进行通信,实现候选解迁移.
在进程内部,将采样、关联子问题与潜在最优超矩形分割等计算量较大的核心计算模块进行线程级并行,以充分利用节点内的多核/众核资源. 为了减少线程在核上动态迁移带来的额外开销,我们采用了线程绑定的方式. 具体地,在每个MPI进程内,首先使用主线程来计算具有数据全局性特点的潜在最优超矩形选择过程. 之后,在OpenMP并行域内,每个线程为各自负责的潜在最优超矩形生成采样点并计算其目标向量,将新采样点全局关联到进程内的相关子问题,计算所负责的新采样点的$ {g^{{\text{sbi}}}} $并进行潜在最优超矩形分割. 此过程中需要注意的是,由于共享变量(子问题的最大和最小投影值等)的存在,多线程同时访问可能引发竞争条件,因此需要使用原子操作语句来确保对共享变量的安全访问;此外,需使用同步语句来确保正确的执行顺序和数据共享. 最后,主线程计算DN指标,并在满足预设条件时将目前Co值最大的若干个候选解迁出到其邻居进程.
采用4.1节的并行方案,则基于MPI+OpenMP的并行DEmo-DIRECT算法(pDEmo-DIRECT)流程如算法2所示.
算法2. pDEmo-DIRECT算法.
输入:最大迭代次数$ T $;
输出:帕累托集PS.
① 启动$ m $个MPI进程; /*MPI_INIT ()*/
② if $ rand\_id = 0 $ then
③  初始化$ N $个权重向量;
④  权重向量排序;
⑤  将权重向量平均分配给各个进程; /*MPI_Scatter ()*/
⑥ end if
⑦ for 每一个进程 do /*每个进程负责处理$ N/m $个子问题*/
⑧  $ t \leftarrow 0 $;
⑨  repeat
⑩   潜在最优超矩形选择;
⑪   设置OpenMP线程数; /*omp_set_num_threads */
⑫   for 每一个线程 do /*pragma omp parallel for*/
⑬    在潜在最优超矩形的每个最长边处进行 采样;
⑭    计算新采样点处的目标函数值;
⑮    新采样点与子问题关联;
⑯    更新子问题的最大、最小投影;
⑰    计算新采样点处的$ {g^{{\text{sbi}}}} $;
⑱    潜在最优超矩形切割;
⑲   end for
⑳   计算指标DN;
㉑   if $ DN\le 预定阈值 $ then
㉒    候选解迁移;
㉓   end if
㉔   $ t = t + 1 $;
㉕  until $ t \geqslant T $
㉖ end for
㉗ return PS.
基于超级计算机“元”的高性能计算环境进行数值实验,从帕累托最优解集的收敛性和多样性2个维度将DEmo-DIRECT与目前主流的多目标优化算法进行了性能对比,以验证算法的有效性. 此外,分析了pDEmo-DIRECT算法的加速效果.
本文的所有实验都是在“元”超级计算机的刀片计算系统上进行的. 该系统包含270个计算节点(单节点配置2颗Intel Xeon E5-2680 V2多核处理器,处理器时钟频率为2.8 GHz,内存64/128 GB),节点间采用56Gb FDR InfiniBand网络全线速互连. 编译器和MPI库分别是Intel Compiler 2013_sp1.0.080和Intel MPI 4.1.3.049.
ZDT系列函数由Zitzler等人[32]在2000年提出,目前已成为多目标优化领域中经典的2-目标测试用例[33]. 本文使用其中4个函数,分别为ZDT1(凸面的)、ZDT2(凹面的)、ZDT3(非连续的)、ZDT6(凹面非均匀的),用于验证算法在不同PF特征下的性能. 此外,选取DTLZ系列函数中的3-目标DTLZ5[34]作为另一个测试用例. 该测试用例为凹面退化的,用于考察算法在高维空间中收敛到低维PF的能力. 各测试用例皆为无约束最小化问题.
NSGA-II是最优秀和最稳定的多目标优化算法之一,已经被验证在快速逼近真实PF和维护解集多样性这2个方面效果良好,目前已成为其他多目标优化算法性能的基准之一. 因此,我们选择该算法作为DEmo-DIRECT的对比算法. 在本文所有测试用例下,NSGA-II的种群数量均设为200,交叉和变异概率分别为0.9和$ 1/nvar $($ nvar $为测试用例变量数),且保证其目标函数计算次数大于DEmo-DIRECT. 在DEmo-DIRECT中,我们设置$ \epsilon ={10}^{-4} $,$ tol = 0.005 $,而停止条件$ T $则根据不同测试用例进行调整. 并行版本的参数与串行算法保持一致.
在进行帕累托最优解集质量评价时,不仅要考虑获得的PF与真实PF的趋近程度,还需考虑前者在目标空间中的分布均匀程度和广泛程度等[35]. 在本文中,我们选择广泛使用的GD(generational distance)[36]、IGD(inverted generational distance)[37]、HV指标用于帕累托最优解集的质量对比. GD和IGD值越小,HV值越大,表示算法所得解集的性能越优[38].
基于以上5个测试用例,我们从HV,GD,IGD,PF 这4个方面对NSGA-II与DEmo-DIRECT进行了比较. 图5~9展示了上述2种算法在不同测试用例上的PF对比情况,其中曲线为测试用例的真实PF.
从图5~9可以看出,在本文所有测试用例下,DEmo-DIRECT都能够很好地近似到问题的真实PF;除了ZDT3测试用例外,DEmo-DIRECT都可得到在均匀性和覆盖性上优于NSGA-II的PF;对于ZDT3测试用例,DEmo-DIRECT与NSGA-II的表现不相上下. 也就是说,DEmo-DIRECT可在保证收敛性的同时,获得分布均匀程度和广泛程度都较为出色的帕累托解集,且具有较为优秀的从高维空间中收敛到低维PF的能力.
下面给出DEmo-DIRECT与NSGA-II的性能度量指标对比,定量地说明其优越性. 对于每一个测试用例,NSGA-II独立运行30次以计算其PF的各项性能指标,并统计它们的均值和方差. 表1展示了2种算法的性能指标对比情况.
由表1可以看出,对于除ZDT3外的所有优化问题,DEmo-DIRECT的GD,IGD,HV指标均优于NSGA-II;而在ZDT3问题中,DEmo-DIRECT在IGD与HV指标上略逊一筹,在GD指标上具有显著优势,说明其与NSGA-II在此测试用例上表现不相上下,这也与PF对比实验结果一致.
综上所述,DEmo-DIRECT在具有凸的、非凸的以及非均匀的PF特征的2-目标优化问题上均有着较为优秀的表现,在求解PF不连续的2-目标优化问题时与NSGA-II性能相当;同时,在DTLZ5测试用例上的实验结果表明了其可在高维空间中有效收敛到低维PF.
基于5.1节的测试用例,我们利用数值实验验证算法并行对DEmo-DIRECT的优化性能带来的影响. 由于子问题内并行化并没有对原算法进行本质的改动,只加快了潜在最优超矩形的分割速度,对解集的质量和PF并无影响,所以只需要分析不同子问题分组数量(即进程数)对算法优化能力的影响. 图10给出了不同并行规模下pDEmo-DIRECT的HV值,其中$ n\_sp $表示进程数,$ n\_sp{\text{ = 1}} $时算法与串行算法的结果完全一致.
由图10可以看出,在所有测试用例下,进程数的增多使得HV指标值存在不同程度的提升. 可能的原因是,pDEmo-DIRECT在并行方案中设计了自适应关联迁移策略自适应地为相邻进程进行个体替换,更好地维护了各进程中解的多样性,使得pDEmo-DIRECT所得PF对真实PF的近似精度相对于串行算法有了一定程度的提升. 为了验证上述猜想,我们给出了未使用自适应关联迁移策略的pDEmo-DIRECT的HV值,如图11所示.
由图11可以看出,在所有测试用例下,相同并行规模的pDEmo-DIRECT的HV指标值皆存在一定程度的下降,甚至都小于串行算法所得的HV值. 可能的原因是,未加入自适应关联迁移策略的pDEmo-DIRECT将原问题产生的不同子问题分配到不同的计算节点上进行计算,相比于串行算法中所有子问题同时优化而言,单个计算节点内子问题数量较少,且仅以预先设定好的频率将一定数目的优秀个体(潜在最优超矩形)与相邻计算节点进行交换,搜索空间变窄且规避了不同的解引导转移搜索方向的情况,使得部分解空间无法得到充分的探索,易导致陷入局部最优、PF断裂等问题,从而降低了多样性和收敛性,HV值较串行算法有所降低.
结合图10和图11的结果可知,采用本文提出的自适应关联迁移策略,并行算法得到的PF在分布、延展以及逼近性能上都有所提升,未出现普遍存在于并行多目标优化算法中的帕累托解集分布不均匀、难以完整覆盖真实PF的情况.
本节基于ZDT1和ZDT2测试用例,计算pDEmo-DIRECT算法在不同并行规模下的加速比,结果如图12所示,其中每个进程创建20个线程.
从图12可以看出,随着进程数$ m $的增加,pDEmo-DIRECT在2个测试用例上的加速比均呈快速上升趋势,但与理论加速比相比有一定差距. 一是因为每一个进程的计算任务都是与原问题性质相似的子问题组,运行时间取决于耗时最长的子问题组的求解时间,这种负载不均衡会在一定程度上造成加速比的下降. 二是因为,为了保证进程内解的多样性,进程间会基于DN指标计算结果不定时地进行个体迁移,虽然相较每代迁移避免了不必要的通信开销,但通信量仍然保持在相对较高的水平,使得加速比进一步下降. 此外,在相同并行规模时,相比ZDT2测试用例,pDEmo-DIRECT在ZDT1测试用例上的加速比更高. 这可能是因为ZDT1测试用例问题结构相对较简单,PF较为平滑且更接近于凸形,在相同并行规模下,维持较好多样性时需要的通信开销通常更低.
总而言之,pDEmo-DIRECT在测试用例上表现出了较为明显的加速效果,但在可扩展性方面还存在一定提升空间,特别是需要解决负载均衡和通信开销的挑战. 这些挑战对于进一步提升pDEmo-DIRECT在大规模MOPs求解中的性能至关重要,因此需要在未来研究工作中重点关注.
本文基于目标分解技术提出一种全局确定性多目标优化算法,并充分利用其并行化来求解复杂的MOPs. 通过分解与目标函数聚合,将一个MOP分解为若干子问题,从而降低了问题求解的难度. 不同于常用的分解方法,为了更好地捕捉凸形、凹形或陡峭等复杂前沿,本文提出了一种归一分解方法,使算法在保持多样性的同时可更快更好地收敛到PF. 对于分解后的子问题,采用Dividing Rectangles算法同时优化,并在该过程中提出了一种全局关联机制,以更好地保留优秀候选解,提升算法搜索效率. 此外,为了进一步缩短问题求解时间,本文采用多层次多粒度并行的思想,将所提出算法进行了并行化,并提出了一种自适应关联迁移策略,以解决因单个计算节点内子问题数量较少而易陷入局部最优的问题. 将所提方法应用于ZDT和DTLZ问题,并与典型的进化算法NSGA-II比较. 实验结果表明,在几乎所有测试用例上,所提串行算法的性能皆优于NSGA-II;此外,还验证了自适应关联迁移策略可有效提升算法的PF前沿近似精度,并行算法可大规模缩短问题求解时间,有望为大规模MOPs的快速求解提供计算支撑.
在本文的实验中,仅通过典型基准优化问题来验证了本文方法的有效性,还没有将其应用于实际的优化问题中. 因此,在未来的工作中将进一步验证其在现实MOPs中的性能表现. 此外,针对并行算法中存在的负载均衡问题,可考虑基于子问题组新产生的超矩形的数量等因素,提出新的负载均衡策略,从而进一步提升并行算法效率和可扩展性.
作者贡献声明:李晨提出了算法思路和实验方案,并负责程序实现、数据分析、论文撰写与修订;陈逸东负责实验结果可视化与论文修订;陆忠华负责研究指导、论文审阅与修订;杨雪莹负责实验结果可视化;王子田负责实验方案优化与改进;迟学斌负责研究指导、论文审阅.

参考文献 引证文献
排序方式:
1
Wong C S Y, Al-Dujaili A, Sundaram S. Hypervolume-based direct for multi-objective optimization [C] //Proc of the 16th Genetic and Evolutionary Computation Conf Companion. New York: ACM, 2016: 1201−1208
2
田野. 高维多目标优化算法的若干关键问题研究 [D]. 合肥:安徽大学,2015
Tian Ye. Research on several key problems of many-objective optimization algorithms [D]. Hefei: Anhui University, 2015 (in Chinese)
3
Zelinka I. A survey on evolutionary algorithms dynamics and its complexity−Mutual relations, past, present and future[J]. Swarm and Evolutionary Computation, 2015, 25: 2−14
4
Hernandez Gomez R, Coello Coello C A, Alba E. A parallel version of SMS-EMOA for many-objective optimization problems [C] // Proc of the 16th Genetic and Evolutionary Computation Conf Companion. New York: ACM, 2016: 568−577
5
Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182−197
6
Zhang Qingfu, Li Hui. MOEA/D: A multiobjective evolutionary algorithm based on decomposition[J]. IEEE Transactions on Evolutionary Computation, 2007, 11(6): 712−731
7
Deb K, Jain H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints[J]. IEEE Transactions on Evolutionary Computation, 2013, 18(4): 577−601
8
Mashwani W K. MOEA/D with DE and PSO: MOEA/D-DE+ PSO [C] //Proc of the 31st SGAI Int Conf on Innovative Techniques and Applications of Artificial Intelligence. Berlin: Springer, 2011: 217−221
9
Jones D R, Perttunen C D, Stuckman B E. Lipschitzian optimization without the Lipschitz constant[J]. Journal of Optimization Theory and Applications, 1993, 79(1): 157−181
10
Jones D R, Martins J R. The DIRECT algorithm: 25 years later[J]. Journal of Global Optimization, 2021, 79((3): ): 521−566
11
Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257−271
12
唐炜森. 基于hypervolume的多目标优化算法研究 [D]. 广州:广东工业大学,2018
Tang Weisen. Research on hypervolume based evolutionary multi-objective optimization algorithms [D]. Guangzhou: Guangdong University of Technology, 2018 (in Chinese)
13
刘垚,郑琳,郑凯,等. 基于申威众核处理器的NSGA-Ⅱ并行和优化方法[J]. 计算机应用研究,2020,37(1):96−101
Liu Yao, Zheng Lin, Zheng Kai, et al. Parallelization and optimization of NSGA-Ⅱ based on Sunway many-core processor[J]. Application Research of Computers, 2020, 37(1): 96−101 (in Chinese)
14
Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm[J]. Technical Report Gloriastrasse, 2001, 103(1): 1−21
15
Zhan Zhihui, Li Jingjing, Cao Jiannong, et al. Multiple populations for multiple objectives: A coevolutionary technique for solving multiobjective optimization problems[J]. IEEE Transactions on Cybernetics, 2013, 43(2): 445−463
16
Liu Hailin, Gu Fangqing, Zhang Qingfu. Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems[J]. IEEE Transactions on Evolutionary Computation, 2014, 18(3): 450−455
17
Cheng Ran, Jin Yaochu, Olhofer M, et al. A reference vector guided evolutionary algorithm for many-objective optimization[J]. IEEE Transactions on Evolutionary Computation, 2016, 20(5): 773−791
18
Zitzler E, Künzli S. Indicator-based selection in multiobjective search [C] //Proc of the 8th Int Conf on Parallel Problem Solving from Nature-PPSN VIII. Berlin: Springer, 2004: 832−842
19
Bader J, Zitzler E. HypE: An algorithm for fast hypervolume-based many-objective optimization[J]. Evolutionary Computation, 2011, 19(1): 45−76
20
Falcón-Cardona J G, Coello Coello A C. A new indicator-based many-objective ant colony optimizer for continuous search spaces[J]. Swarm Intelligence, 2017, 11(1): 71−100
21
Shubert B O. A sequential method seeking the global maximum of a function [J]. SIAM Journal on Numerical Analysis, 1972, 9(3): 379−388
22
Wang Luyi, Ishida H, Hiroyasu T, et al. Examination of multiobjective optimization method for global search using DIRECT and GA [C] //Proc of the 2008 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2008: 2446−2451
23
Al-Dujaili A, Suresh S. Dividing rectangles attack multi-objective optimization [C] //Proc of the 2016 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2016: 3606−3613
24
Campana E F, Diez M, Liuzzi G S, et al. A multi-objective direct algorithm for ship hull optimization[J]. Computational Optimization and Applications, 2018, 71(1): 53−72
25
Houssein E H, Mahdy M A, Shebl D, et al. An efficient slime mould algorithm for solving multi-objective optimization problems[J]. Expert Systems with Application, 2022, 187: 115870
26
Miettinen K. Nonlinear Multiobjective Optimization [M]. New York: Springer, 2012
27
万沙沙,裴丽,王喜奎,等. 利用DIRECT算法设计基于FBG延迟线的微波光子滤波器[J]. 光电技术应用,2008,23(6):41−44
Wan Shasha, Pei Li, Wang Xikui, et al. Design of PMF based on FBG delay line using DIRECT algorithm[J]. Electrooptic Technology Application, 2008, 23(6): 41−44 (in Chinese)
28
何洪文,黄贤广,张亚明,等. 基于DIRECT算法的混合动力汽车参数优化研究[J]. 汽车工程学报,2011,1(1):35−41
He Hongwen, Huang Xianguang, Zhang Yaming, et al. Study on parameters optimization of hybrid electric vehicle based on DIRECT algorithm[J]. Chinese Journal of Automotive Engineering, 2011, 1(1): 35−41 (in Chinese)
29
Mohammadi A, Omidvar M N, Li Xiaodong. Reference point based multi-objective optimization through decomposition [C] //Proc of the 2012 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2012: 1150−1157
30
魏建乐. 基于协同分解的多目标进化算法设计与应用 [D]. 广州:广州大学,2022
Wei Jianle. Design and application of multi-objective evolutionary algorithm based on cooperative decomposition [D]. Guangzhou: Guangzhou University, 2022 (in Chinese)
31
王丽萍,吴峰,张梦紫,等. 基于差异化邻域策略的分解多目标进化算法[J]. 模式识别与人工智能,2017,30(12):1069−1082
Wang Liping, Wu Feng, Zhang Mengzi, et al. Decomposition multi-objective evolutionary algorithm based on differentiated neighborhood strategy[J]. Pattern Recognition and Artificial Intelligence, 2017, 30(12): 1069−1082 (in Chinese)
32
Zitzler E, Deb K, Thiele L. Comparison of multiobjective evolutionary algorithms: Empirical results[J]. Evolutionary Computation, 2000, 8(2): 173−195
33
李璐. 基于双层分解的并行多目标演化算法研究 [D]. 西安:西安电子科技大学,2020
Li Lu. Research on parallel multi-objective evolutionary algorithm based on bi-level decomposition [D]. Xi’an: Xidian University, 2020 (in Chinese)
34
Deb K, Thiele L, Laumanns M, et al. Scalable Test Problems for Evolutionary Multiobjective Optimization [M]. Berlin: Springer, 2005
35
葛梦瑶. 人工蜂群算法在多目标模糊投资组合优化中的应用 [D]. 北京:首都经济贸易大学,2016
Ge Mengyao. Application of artificial bee colony algorithm in multi-objective fuzzy portfolio optimization [D]. Beijing: Capital University of Economics and Business, 2016 (in Chinese)
36
Van Veldhuizen D A. Multiobjective evolutionary algorithms: Classifications, analyses, and new innovations [D]. Dayton, OH: Air Force Institute of Technology, 1999
37
Coello Coello C A, Reyes Sierra M. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm [C] //Proc of the 3rd Mexican Int Conf on Artificial Intelligence. Berlin: Springer, 2004: 688−697
38
Li Chen, Wu Yulei, Lu Zhonghua, et al. A multiperiod multiobjective portfolio selection model with fuzzy random returns for large scale securities data[J]. IEEE Transactions on Fuzzy Systems, 2021, 29(1): 59−74
2024年第61卷第11期
67
32
0
引用本文
BibTeX
文章信息
doi: 10.7544/issn1000-1239.202330093
  • 接收时间:2023-02-16
  • 首发时间:2026-11-17
  • 出版时间:2024-11-01
补充材料
相关文章
文章信息
作者
出版历史
  • 收稿日期:2023-02-16
  • 修回日期:2023-12-29
  • 录用日期:2024-03-06
基金
作者信息
    1中国科学院计算机网络信息中心 北京 100083
    2中国科学院大学 北京 100049
    3北京智速科技有限公司 北京 100037
参考文献
分享链接
https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202330093
分享至
全文二维码

扫描看全文

引用本文
BibTeX
本文的引用情况
2种不同金属材料的力学参数
科
Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)
属
Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏