Surrogate-Assisted Evolutionary Algorithm With Model and Infill Criterion Auto-Configuration

被引:15
|
作者
Xie, Lindong [1 ]
Li, Genghui [1 ]
Wang, Zhenkun [1 ,2 ]
Cui, Laizhong [3 ,4 ]
Gong, Maoguo [5 ]
机构
[1] Southern Univ Sci & Technol, Sch Syst Design & Intelligent Mfg, Shenzhen 518055, Peoples R China
[2] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
[3] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[4] Shenzhen Univ, Guangdong Lab Artificial Intelligence & Digital Ec, Shenzhen 518060, Peoples R China
[5] Xidian Univ, Key Lab Collaborat Intelligence Syst, Minist Educ, Xian, Peoples R China
基金
中国国家自然科学基金;
关键词
Auto algorithm design; expensive optimization; surrogate-assisted evolutionary algorithm (SAEA); two-level multiarmed bandit (TL-MAB); OPTIMIZATION; APPROXIMATION;
D O I
10.1109/TEVC.2023.3291614
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Surrogate-assisted evolutionary algorithms (SAEAs) have proven to be effective in solving computationally expensive optimization problems (EOPs). However, the performance of SAEAs heavily relies on the surrogate model and infill criterion used. To improve the generalization of SAEAs and enable them to solve a wide range of EOPs, this article proposes an SAEA called AutoSAEA, which features model and infill criterion auto-configuration. Specifically, AutoSAEA formulates model and infill criterion selection as a two-level multiarmed bandit problem (TL-MAB). The first and second levels cooperate in selecting the surrogate model and infill criterion, respectively. A two-level reward (TL-R) measures the value of the surrogate model and infill criterion, while a two-level upper confidence bound (TL-UCB) selects the model and infill criterion in an online manner. Numerous experiments validate the superiority of AutoSAEA over some state-of-the-art SAEAs on complex benchmark problems and a real-world oil reservoir production optimization problem.
引用
收藏
页码:1114 / 1126
页数:13
相关论文
共 50 条
  • [21] A Surrogate-Assisted Evolutionary Algorithm for Space Component Thermal Layout Optimization
    Han, Lei
    Wang, Handing
    Wang, Shuo
    Space: Science and Technology (United States), 2022, 2022
  • [22] A pairwise ranking estimation model for surrogate-assisted evolutionary algorithms
    Harada, Tomohiro
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (06) : 6875 - 6890
  • [23] Predictability on Performance of Surrogate-assisted Evolutionary Algorithm According to Problem Dimension
    Yu, Dong-Pil
    Kim, Yong-Hyuk
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 91 - 92
  • [24] Improved ensemble learning classification based surrogate-assisted evolutionary algorithm
    Gu Q.-H.
    Zhang X.-Y.
    Chen L.
    Kongzhi yu Juece/Control and Decision, 2022, 37 (10): : 2456 - 2466
  • [25] HAS-EA: a fast parallel surrogate-assisted evolutionary algorithm
    Yixian Li
    Jinghui Zhong
    Memetic Computing, 2023, 15 : 103 - 115
  • [26] Max-min surrogate-assisted evolutionary algorithm for robust design
    Ong, Yew-Soon
    Nair, Prasanth B.
    Lum, Kai Yew
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (04) : 392 - 404
  • [27] Algorithm Portfolio for Individual-based Surrogate-Assisted Evolutionary Algorithms
    Tong, Hao
    Liu, Jialin
    Yao, Xin
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 943 - 950
  • [28] Performance Analysis of a (1+1) Surrogate-Assisted Evolutionary Algorithm
    Chen, Yu
    Zou, Xiufen
    INTELLIGENT COMPUTING THEORY, 2014, 8588 : 32 - 40
  • [29] A surrogate-assisted bi-swarm evolutionary algorithm for expensive optimization
    Nengxian Liu
    Jeng-Shyang Pan
    Shu-Chuan Chu
    Taotao Lai
    Applied Intelligence, 2023, 53 : 12448 - 12471
  • [30] A dynamic surrogate-assisted evolutionary algorithm framework for expensive structural optimization
    Yu, Mingyuan
    Li, Xia
    Liang, Jing
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2020, 61 (02) : 711 - 729