Surrogate-assisted fully-informed particle swarm optimization for high-dimensional expensive optimization

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Chongle Ren , Qiutong Xu , Zhenyu Meng , Jeng-Shyang Pan
{"title":"Surrogate-assisted fully-informed particle swarm optimization for high-dimensional expensive optimization","authors":"Chongle Ren ,&nbsp;Qiutong Xu ,&nbsp;Zhenyu Meng ,&nbsp;Jeng-Shyang Pan","doi":"10.1016/j.asoc.2024.112464","DOIUrl":null,"url":null,"abstract":"<div><div>Surrogate-Assisted Evolutionary Algorithms (SAEAs) have been proven to be powerful optimization tools for tackling Expensive Optimization Problems (EOPs) where a limited number of function evaluations are available. However, many SAEAs are only designed for low- or medium-dimensional EOPs. Existing SAEAs are challenging to address High-dimensional EOPs (HEOPs) owing to the curse of dimensionality and lack of powerful exploitation capacity. To tackle HEOPs efficiently, a Surrogate-Assisted Fully-informed Particle Swarm Optimization (SA-FPSO) algorithm is proposed in this paper. Firstly, a generation-based Social Learning-based PSO (SLPSO) is adopted to explore the whole decision space with the help of the global surrogate model. Secondly, the fully-informed search scheme is incorporated into the framework of SLPSO to improve its exploitation capacity in the surrogate-assisted search environment. Thirdly, a local space identification strategy is proposed to determine the search range for the local surrogate-assisted search. Seven commonly used expensive benchmark functions with dimensions ranging from 30D to 300D are used to verify the performance of SA-FPSO for HEOPs. Experiment results indicate that SA-FPSO obtains superior performance over several state-of-the-art SAEAs both in terms of convergence speed and solution accuracy.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"167 ","pages":"Article 112464"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624012389","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

Surrogate-Assisted Evolutionary Algorithms (SAEAs) have been proven to be powerful optimization tools for tackling Expensive Optimization Problems (EOPs) where a limited number of function evaluations are available. However, many SAEAs are only designed for low- or medium-dimensional EOPs. Existing SAEAs are challenging to address High-dimensional EOPs (HEOPs) owing to the curse of dimensionality and lack of powerful exploitation capacity. To tackle HEOPs efficiently, a Surrogate-Assisted Fully-informed Particle Swarm Optimization (SA-FPSO) algorithm is proposed in this paper. Firstly, a generation-based Social Learning-based PSO (SLPSO) is adopted to explore the whole decision space with the help of the global surrogate model. Secondly, the fully-informed search scheme is incorporated into the framework of SLPSO to improve its exploitation capacity in the surrogate-assisted search environment. Thirdly, a local space identification strategy is proposed to determine the search range for the local surrogate-assisted search. Seven commonly used expensive benchmark functions with dimensions ranging from 30D to 300D are used to verify the performance of SA-FPSO for HEOPs. Experiment results indicate that SA-FPSO obtains superior performance over several state-of-the-art SAEAs both in terms of convergence speed and solution accuracy.
用于高维昂贵优化的代理辅助全信息粒子群优化技术
代用辅助进化算法(SAEAs)已被证明是解决昂贵优化问题(EOPs)的强大优化工具,可用于有限数量的函数评估。然而,许多 SAEA 只针对低维或中维 EOP 设计。由于维度诅咒和缺乏强大的开发能力,现有的 SAEA 在处理高维 EOP(HEOP)时面临挑战。为有效解决高维 EOP,本文提出了一种代理辅助全信息粒子群优化(SA-FPSO)算法。首先,采用基于代际社会学习的 PSO(SLPSO),借助全局代理模型探索整个决策空间。其次,在 SLPSO 框架中加入了完全知情搜索方案,以提高其在代理辅助搜索环境中的利用能力。第三,提出了一种局部空间识别策略,以确定局部代理辅助搜索的搜索范围。为了验证 SA-FPSO 在 HEOPs 中的性能,我们使用了七个常用的昂贵基准函数,维数从 30D 到 300D。实验结果表明,SA-FPSO 在收敛速度和求解精度方面都优于几种最先进的 SAEA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术官方微信