AIEA: An Asynchronous Influence-Based Evolutionary Algorithm for Expensive Many-Objective Optimization

IF 10.5 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Feng-Feng Wei;Wei-Neng Chen;Jun Zhang
{"title":"AIEA: An Asynchronous Influence-Based Evolutionary Algorithm for Expensive Many-Objective Optimization","authors":"Feng-Feng Wei;Wei-Neng Chen;Jun Zhang","doi":"10.1109/TCYB.2024.3501360","DOIUrl":null,"url":null,"abstract":"In expensive multi/many-objective optimization problems (EMOPs), the expensive objectives are generally accessed through different simulation tools, leading to different evaluation latencies and unbearable computational time for serial optimization. One promising approach to improve efficiency is to perform simulation and build surrogates separately for each objective in parallel. However, how to improve the model accuracy and select promising candidates without global information are big challenges. To alleviate these problems, this article proposes an asynchronous influence-based SAEA (AIEA) based on the client-server model. Each client approximates an objective and the server takes charge for evolution. To adaptively select promising candidates, the influence degree is introduced in candidate selection, which is calculated in the objective space to judge which candidate has more beneficial influence for evolution. With the selected candidate, the most-uncertain-first strategy is devised in objective selection for asynchronous evaluations and model improvement. To handle incomplete objective values, the nearest neighbor inheritance is adopted for unevaluated objectives. Comprehensive experiments compared with five surrogate-assisted EAs demonstrate the global optimization and scalability of AIEA.","PeriodicalId":13112,"journal":{"name":"IEEE Transactions on Cybernetics","volume":"55 2","pages":"786-799"},"PeriodicalIF":10.5000,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cybernetics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10786485/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In expensive multi/many-objective optimization problems (EMOPs), the expensive objectives are generally accessed through different simulation tools, leading to different evaluation latencies and unbearable computational time for serial optimization. One promising approach to improve efficiency is to perform simulation and build surrogates separately for each objective in parallel. However, how to improve the model accuracy and select promising candidates without global information are big challenges. To alleviate these problems, this article proposes an asynchronous influence-based SAEA (AIEA) based on the client-server model. Each client approximates an objective and the server takes charge for evolution. To adaptively select promising candidates, the influence degree is introduced in candidate selection, which is calculated in the objective space to judge which candidate has more beneficial influence for evolution. With the selected candidate, the most-uncertain-first strategy is devised in objective selection for asynchronous evaluations and model improvement. To handle incomplete objective values, the nearest neighbor inheritance is adopted for unevaluated objectives. Comprehensive experiments compared with five surrogate-assisted EAs demonstrate the global optimization and scalability of AIEA.
一种基于影响的异步多目标优化进化算法
在昂贵的多/多目标优化问题(EMOPs)中,昂贵的目标通常通过不同的仿真工具来访问,这导致了不同的评估延迟和串行优化的难以承受的计算时间。提高效率的一种有希望的方法是并行地为每个目标分别进行模拟和构建代理。然而,如何在没有全局信息的情况下提高模型精度并选择有希望的候选者是一个很大的挑战。为了缓解这些问题,本文提出了一种基于客户机-服务器模型的异步基于影响的SAEA (AIEA)。每个客户端近似于一个目标,服务器负责演进。为了自适应地选择有前途的候选物种,在候选物种选择中引入影响度,在客观空间中计算影响度,判断哪个候选物种对进化更有利。根据选定的候选对象,设计了最不确定优先的目标选择策略,用于异步评估和模型改进。为了处理不完整的目标值,对未求值的目标采用最近邻继承。通过与5种代理辅助ea的综合实验对比,验证了AIEA的全局优化和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cybernetics
IEEE Transactions on Cybernetics COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, CYBERNETICS
CiteScore
25.40
自引率
11.00%
发文量
1869
期刊介绍: The scope of the IEEE Transactions on Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or machine, human, and organizations. The scope includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, cognitive systems, decision making, and robotics, to the extent that they contribute to the theme of cybernetics or demonstrate an application of cybernetics principles.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信