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

被引:5
作者
Ren, Chongle [1 ]
Xu, Qiutong [1 ]
Meng, Zhenyu [1 ]
Pan, Jeng-Shyang [2 ,3 ]
机构
[1] Fujian Univ Technol, Inst Artificial Intelligence, Fuzhou, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Artificial Intelligence, Nanjing, Peoples R China
[3] Chaoyang Univ Technol, Dept Informat Management, Taichung, Taiwan
关键词
High-dimensional expensive optimization; Particle swarm optimization; Surrogate-assisted evolutionary algorithm; DIFFERENTIAL EVOLUTION ALGORITHM; DESIGN OPTIMIZATION; APPROXIMATION;
D O I
10.1016/j.asoc.2024.112464
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:16
相关论文
共 55 条
[1]  
Abbott I. H., 2012, Theory of Wing Sections: Including a Summary of Airfoil Data
[2]   A New Initialization Approach in Particle Swarm Optimization for Global Optimization Problems [J].
Bangyal, Waqas Haider ;
Hameed, Abdul ;
Alosaimi, Wael ;
Alyami, Hashem .
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2021, 2021
[3]  
Bansal J.C., 2011, Third World Congress on Nature and Biologically Inspired Computing, P640
[4]  
Bonte MHA, 2010, STRUCT MULTIDISCIP O, V42, P797, DOI 10.1007/s00158-010-0545-3
[5]   Surrogate-guided differential evolution algorithm for high dimensional expensive problems [J].
Cai, Xiwen ;
Gao, Liang ;
Li, Xinyu ;
Qiu, Haobo .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 48 :288-311
[6]   Optimizing the parameters of hybrid active power filters through a comprehensive and dynamic multi-swarm gravitational search algorithm [J].
Chauhan, Dikshit ;
Yadav, Anupam .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 123
[7]   A Competitive Swarm Optimizer for Large Scale Optimization [J].
Cheng, Ran ;
Jin, Yaochu .
IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (02) :191-204
[8]   A social learning particle swarm optimization algorithm for scalable optimization [J].
Cheng, Ran ;
Jin, Yaochu .
INFORMATION SCIENCES, 2015, 291 :43-60
[9]   Fuzzy Hierarchical Surrogate Assists Probabilistic Particle Swarm Optimization for expensive high dimensional problem [J].
Chu, Shu-Chuan ;
Du, Zhi-Gang ;
Peng, Yan-Jun ;
Pan, Jeng-Shyang .
KNOWLEDGE-BASED SYSTEMS, 2021, 220
[10]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73