Knee-oriented expensive many-objective optimization via aggregation-dominance: A multi-task perspective

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Junfeng Tang , Handing Wang , Yaochu Jin
{"title":"Knee-oriented expensive many-objective optimization via aggregation-dominance: A multi-task perspective","authors":"Junfeng Tang ,&nbsp;Handing Wang ,&nbsp;Yaochu Jin","doi":"10.1016/j.swevo.2024.101813","DOIUrl":null,"url":null,"abstract":"<div><div>Given the costs to implement whole Pareto optimal solutions, users often prefer solutions of interest, like knee points, which represent naturally preferred solutions without a specific bias. Recent surrogate-assisted multi-objective evolutionary algorithms (SAMOEAs) incorporating knee identification techniques have been suggested, but most of them cannot find knee solutions for expensive many-objective optimization problems. This work proposes a Kriging-assisted evolutionary multi-task algorithm with aggregation-dominance. The aggregation-dominance approach identifies knee points on an estimated Pareto front, from which subproblems are created and solved in parallel via Kriging-assisted multi-task optimization for guiding search knee solutions. Additionally, our proposed infill solutions selection strategy focuses on re-evaluating solutions converging in regions of interest. Experimental results on knee-oriented benchmark problems show that our algorithm outperforms state-of-the-art methods, with aggregation-dominance surpassing five existing knee identification techniques. We also validate the algorithm’s performance on the portfolio allocation problem.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101813"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003511","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Given the costs to implement whole Pareto optimal solutions, users often prefer solutions of interest, like knee points, which represent naturally preferred solutions without a specific bias. Recent surrogate-assisted multi-objective evolutionary algorithms (SAMOEAs) incorporating knee identification techniques have been suggested, but most of them cannot find knee solutions for expensive many-objective optimization problems. This work proposes a Kriging-assisted evolutionary multi-task algorithm with aggregation-dominance. The aggregation-dominance approach identifies knee points on an estimated Pareto front, from which subproblems are created and solved in parallel via Kriging-assisted multi-task optimization for guiding search knee solutions. Additionally, our proposed infill solutions selection strategy focuses on re-evaluating solutions converging in regions of interest. Experimental results on knee-oriented benchmark problems show that our algorithm outperforms state-of-the-art methods, with aggregation-dominance surpassing five existing knee identification techniques. We also validate the algorithm’s performance on the portfolio allocation problem.
基于聚合优势的面向膝盖的昂贵多目标优化:多任务视角
考虑到实现整个帕累托最优解的成本,用户通常更喜欢感兴趣的解,比如膝盖点,它代表了没有特定偏见的自然首选解。最近提出了结合膝关节识别技术的代理辅助多目标进化算法(samoea),但大多数算法无法找到昂贵的多目标优化问题的膝关节解。本文提出了一种kriging辅助的聚合-优势进化多任务算法。聚合优势方法在估计的帕累托前沿上识别膝盖点,并由此创建子问题,并通过krigig辅助多任务优化并行解决,以指导搜索膝盖解。此外,我们提出的填充解决方案选择策略侧重于重新评估在感兴趣区域收敛的解决方案。在面向膝关节的基准问题上的实验结果表明,我们的算法优于最先进的方法,其聚合优势优于现有的五种膝关节识别技术。我们还验证了该算法在投资组合分配问题上的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信