{"title":"Surrogate-assisted fully-informed particle swarm optimization for high-dimensional expensive optimization","authors":"Chongle Ren , Qiutong Xu , Zhenyu Meng , 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.
期刊介绍:
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.