An Adaptive Surrogate-Assisted Particle Swarm Optimization Algorithm Combining Effectively Global and Local Surrogate Models and Its Application

被引:2
作者
Qu, Shaochun [1 ]
Liu, Fuguang [1 ]
Cao, Zijian [1 ]
机构
[1] Xian Technol Univ, Sch Comp Sci & Engn, Xian 710021, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 17期
关键词
surrogate model; model evaluation; parameter adaptive control; particle swarm optimization; EVOLUTIONARY ALGORITHM; CONVERGENCE;
D O I
10.3390/app14177853
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Numerous surrogate-assisted evolutionary algorithms have been proposed for expensive optimization problems. However, each surrogate model has its own characteristics and different applicable situations, which caused a serious challenge for model selection. To alleviate this challenge, this paper proposes an adaptive surrogate-assisted particle swarm optimization (ASAPSO) algorithm by effectively combining global and local surrogate models, which utilizes the uncertainty level of the current population state to evaluate the approximation ability of the surrogate model in its predictions. In ASAPSO, the transformation between local and global surrogate models is controlled by an adaptive Gaussian distribution parameter with a gauge of the advisability to improve the search process with better local exploration and diversity in uncertain solutions. Four expensive optimization benchmark functions and an airfoil aerodynamic real-world engineering optimization problem are utilized to validate the effectiveness and performance of ASAPSO. Experimental results demonstrate that ASAPSO has superiority in terms of solution accuracy compared with state-of-the-art algorithms.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] Surrogate-assisted evolutionary algorithm with hierarchical surrogate technique and adaptive infill strategy
    Chen, Hao
    Li, Weikun
    Cui, Weicheng
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 232
  • [22] Progressive Sampling Surrogate-Assisted Particle Swarm Optimization for Large-Scale Expensive Optimization
    Wang, Hong-Rui
    Chen, Chun-Hua
    Li, Yun
    Zhang, Jun
    Zhi-Hui-Zhan
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 40 - 48
  • [23] Surrogate-Assisted Multipopulation Particle Swarm Optimizer for High-Dimensional Expensive Optimization
    Liu, Yuanchao
    Liu, Jianchang
    Jin, Yaochu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (07): : 4671 - 4684
  • [24] Application of surrogate-assisted global optimization algorithm with dimension-reduction in power optimization of floating offshore wind farm
    Song, Dongran
    Shen, Xutao
    Gao, Yang
    Wang, Lei
    Du, Xin
    Xu, Zhiliang
    Zhang, Zhihong
    Huang, Chaoneng
    Yang, Jian
    Dong, Mi
    Joo, Young Hoo
    APPLIED ENERGY, 2023, 351
  • [25] Multi-objective global and local Surrogate-Assisted optimization on polymer flooding
    Zhang, Ruxin
    Chen, Hongquan
    FUEL, 2023, 342
  • [26] Surrogate-assisted fully-informed particle swarm optimization for high-dimensional expensive optimization
    Ren, Chongle
    Xu, Qiutong
    Meng, Zhenyu
    Pan, Jeng-Shyang
    APPLIED SOFT COMPUTING, 2024, 167
  • [27] A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems
    Gu, Qinghua
    Wang, Qian
    Li, Xuexian
    Li, Xinhong
    KNOWLEDGE-BASED SYSTEMS, 2021, 223
  • [28] A surrogate-assisted hybrid swarm optimization algorithm for high-dimensional computationally expensive problems
    Li, Fan
    Li, Yingli
    Cai, Xiwen
    Gao, Liang
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 72
  • [29] An efficient surrogate-assisted hybrid optimization algorithm for expensive optimization problems
    Pan, Jeng-Shyang
    Liu, Nengxian
    Chu, Shu-Chuan
    Lai, Taotao
    INFORMATION SCIENCES, 2021, 561 : 304 - 325
  • [30] A Surrogate-Assisted Multiswarm Optimization Algorithm for High-Dimensional Computationally Expensive Problems
    Li, Fan
    Cai, Xiwen
    Gao, Liang
    Shen, Weiming
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (03) : 1390 - 1402