基于双向融合优势的多目标进化算法

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Li-sen Wei, Er-chao Li
{"title":"基于双向融合优势的多目标进化算法","authors":"Li-sen Wei,&nbsp;Er-chao Li","doi":"10.1002/cpe.8196","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Although some many-objective optimization algorithms (MaOEAs) have been proposed recently, Pareto dominance-based MaOEAs still cannot effectively balance convergence and diversity in solving many objective optimization problems (MaOPs) due to insufficient selection pressure. To address this problem, a bi-directional fusion niche domination is proposed. This method merges the strengths of cone and parallel decomposition directions in comparing dominations for nondominance stratification within the candidate population, augmenting the selection pressure of population. Subsequently, the crowding distance is introduced as an additional selection criterion to further refine the selection of nondominated individuals within the critical layer. Lastly, a MaOEA based on bi-directional fusion niche dominance (MaOEA/BnD) is proposed, utilizing bi-directional fusion niche dominance and crowding distance as important components of environmental selection. The performance of MaOEA/BnD was compared with five representative MaOEAs in 20 benchmark problems. Experimental results demonstrate that MaOEA/BnD effectively balances convergence and diversity when handling MaOPs with complex Pareto fronts.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 21","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A many-objective evolutionary algorithm based on bi-direction fusion niche dominance\",\"authors\":\"Li-sen Wei,&nbsp;Er-chao Li\",\"doi\":\"10.1002/cpe.8196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Although some many-objective optimization algorithms (MaOEAs) have been proposed recently, Pareto dominance-based MaOEAs still cannot effectively balance convergence and diversity in solving many objective optimization problems (MaOPs) due to insufficient selection pressure. To address this problem, a bi-directional fusion niche domination is proposed. This method merges the strengths of cone and parallel decomposition directions in comparing dominations for nondominance stratification within the candidate population, augmenting the selection pressure of population. Subsequently, the crowding distance is introduced as an additional selection criterion to further refine the selection of nondominated individuals within the critical layer. Lastly, a MaOEA based on bi-directional fusion niche dominance (MaOEA/BnD) is proposed, utilizing bi-directional fusion niche dominance and crowding distance as important components of environmental selection. The performance of MaOEA/BnD was compared with five representative MaOEAs in 20 benchmark problems. Experimental results demonstrate that MaOEA/BnD effectively balances convergence and diversity when handling MaOPs with complex Pareto fronts.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 21\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8196\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8196","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要尽管近年来提出了一些多目标优化算法(MaOEAs),但由于选择压力不足,基于帕累托优势的 MaOEAs 在求解多目标优化问题(MaOPs)时仍无法有效平衡收敛性和多样性。为解决这一问题,我们提出了一种双向融合的小众支配法。该方法融合了锥形分解方向和平行分解方向在候选种群内对非优势分层进行优势比较的优势,增强了种群的选择压力。随后,引入拥挤距离作为额外的选择标准,进一步完善临界层内非优势个体的选择。最后,利用双向融合生态位优势和拥挤距离作为环境选择的重要组成部分,提出了基于双向融合生态位优势的 MaOEA(MaOEA/BnD)。在 20 个基准问题中,将 MaOEA/BnD 的性能与五个代表性 MaOEA 进行了比较。实验结果表明,在处理具有复杂帕累托前沿的 MaOPs 时,MaOEA/BnD 有效地平衡了收敛性和多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A many-objective evolutionary algorithm based on bi-direction fusion niche dominance

Although some many-objective optimization algorithms (MaOEAs) have been proposed recently, Pareto dominance-based MaOEAs still cannot effectively balance convergence and diversity in solving many objective optimization problems (MaOPs) due to insufficient selection pressure. To address this problem, a bi-directional fusion niche domination is proposed. This method merges the strengths of cone and parallel decomposition directions in comparing dominations for nondominance stratification within the candidate population, augmenting the selection pressure of population. Subsequently, the crowding distance is introduced as an additional selection criterion to further refine the selection of nondominated individuals within the critical layer. Lastly, a MaOEA based on bi-directional fusion niche dominance (MaOEA/BnD) is proposed, utilizing bi-directional fusion niche dominance and crowding distance as important components of environmental selection. The performance of MaOEA/BnD was compared with five representative MaOEAs in 20 benchmark problems. Experimental results demonstrate that MaOEA/BnD effectively balances convergence and diversity when handling MaOPs with complex Pareto fronts.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信