多目标优化问题的改进型基于指标的双存档算法

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS
Weida Song, Shanxin Zhang, Wenlong Ge, Wei Wang
{"title":"多目标优化问题的改进型基于指标的双存档算法","authors":"Weida Song, Shanxin Zhang, Wenlong Ge, Wei Wang","doi":"10.1007/s00607-024-01272-3","DOIUrl":null,"url":null,"abstract":"<p>The large number of objectives in many-objective optimization problems (MaOPs) has posed significant challenges to the performance of multi-objective evolutionary algorithms (MOEAs) in terms of convergence and diversity. To design a more balanced MOEA, a multiple indicator-based two-archive algorithm named IBTA is proposed to deal with problems with complicated Pareto fronts. Specifically, a two-archive framework is introduced to focus on convergence and diversity separately. In IBTA, we assign different selection principles to the two archives. In the convergence archive, the inverted generational distance with noncontributing solution detection (IGD-NS) indicator is applied to choose the solutions with favorable convergence in each generation. In the diversity archive, we use crowdedness and fitness to select solutions with favorable diversity. To evaluate the performance of IBTA on MaOPs, we compare it with several state-of-the-art MOEAs on various benchmark problems with different Pareto fronts. The experimental results demonstrate that IBTA can deal with multi-objective optimization problems (MOPs)/MaOPs with satisfactory convergence and diversity.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"98 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved indicator-based two-archive algorithm for many-objective optimization problems\",\"authors\":\"Weida Song, Shanxin Zhang, Wenlong Ge, Wei Wang\",\"doi\":\"10.1007/s00607-024-01272-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The large number of objectives in many-objective optimization problems (MaOPs) has posed significant challenges to the performance of multi-objective evolutionary algorithms (MOEAs) in terms of convergence and diversity. To design a more balanced MOEA, a multiple indicator-based two-archive algorithm named IBTA is proposed to deal with problems with complicated Pareto fronts. Specifically, a two-archive framework is introduced to focus on convergence and diversity separately. In IBTA, we assign different selection principles to the two archives. In the convergence archive, the inverted generational distance with noncontributing solution detection (IGD-NS) indicator is applied to choose the solutions with favorable convergence in each generation. In the diversity archive, we use crowdedness and fitness to select solutions with favorable diversity. To evaluate the performance of IBTA on MaOPs, we compare it with several state-of-the-art MOEAs on various benchmark problems with different Pareto fronts. The experimental results demonstrate that IBTA can deal with multi-objective optimization problems (MOPs)/MaOPs with satisfactory convergence and diversity.</p>\",\"PeriodicalId\":10718,\"journal\":{\"name\":\"Computing\",\"volume\":\"98 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00607-024-01272-3\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01272-3","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

多目标优化问题(MaOPs)中的大量目标对多目标进化算法(MOEAs)在收敛性和多样性方面的性能提出了巨大挑战。为了设计一种更加平衡的 MOEA,我们提出了一种名为 IBTA 的基于多指标的双拱算法,以处理具有复杂帕累托前沿的问题。具体来说,我们引入了一个双档案框架,分别关注收敛性和多样性。在 IBTA 中,我们为两个档案分配了不同的选择原则。在收敛性档案中,我们采用非贡献解检测(IGD-NS)的倒代距离指标来选择每一代中收敛性良好的解。在多样性档案中,我们使用拥挤度和适合度来选择具有良好多样性的解决方案。为了评估 IBTA 在 MaOPs 上的性能,我们在具有不同帕累托前沿的各种基准问题上将其与几种最先进的 MOEAs 进行了比较。实验结果表明,IBTA 能够以令人满意的收敛性和多样性处理多目标优化问题(MOPs)/MaOPs。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An improved indicator-based two-archive algorithm for many-objective optimization problems

An improved indicator-based two-archive algorithm for many-objective optimization problems

The large number of objectives in many-objective optimization problems (MaOPs) has posed significant challenges to the performance of multi-objective evolutionary algorithms (MOEAs) in terms of convergence and diversity. To design a more balanced MOEA, a multiple indicator-based two-archive algorithm named IBTA is proposed to deal with problems with complicated Pareto fronts. Specifically, a two-archive framework is introduced to focus on convergence and diversity separately. In IBTA, we assign different selection principles to the two archives. In the convergence archive, the inverted generational distance with noncontributing solution detection (IGD-NS) indicator is applied to choose the solutions with favorable convergence in each generation. In the diversity archive, we use crowdedness and fitness to select solutions with favorable diversity. To evaluate the performance of IBTA on MaOPs, we compare it with several state-of-the-art MOEAs on various benchmark problems with different Pareto fronts. The experimental results demonstrate that IBTA can deal with multi-objective optimization problems (MOPs)/MaOPs with satisfactory convergence and diversity.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
×
引用
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学术官方微信