Evolutionary Computation for Expensive Optimization: A Survey

被引:89
作者
Li, Jian-Yu [1 ,2 ]
Zhan, Zhi-Hui [1 ,2 ]
Zhang, Jun [3 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[2] Pazhou Lab, Guangzhou 510330, Peoples R China
[3] Victoria Univ, Melbourne, Vic 8001, Australia
基金
新加坡国家研究基金会;
关键词
Expensive optimization problem; evolutionary computation; evolutionary algorithm; swarm intelligence; particle swarm optimization; differential evolution; PARTICLE SWARM OPTIMIZATION; MULTIOBJECTIVE OPTIMIZATION; COOPERATIVE COEVOLUTION; DIFFERENTIAL EVOLUTION; SURROGATE MODEL; ALGORITHM; STRATEGY; APPROXIMATION; MULTITASKING;
D O I
10.1007/s11633-022-1317-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Expensive optimization problem (EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation (EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.
引用
收藏
页码:3 / 23
页数:21
相关论文
共 165 条
[61]  
Kong QQ, 2016, PROCEEDINGS OF THE 2016 12TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), P2126, DOI 10.1109/WCICA.2016.7578825
[62]  
Koziel S, 2010, APPL COMPUT ELECTROM, V25, P578
[63]   Two-level Multi-surrogate Assisted Optimization method for high dimensional nonlinear problems [J].
Li, Enying ;
Wang, Hu ;
Ye, Fan .
APPLIED SOFT COMPUTING, 2016, 46 :26-36
[64]   Multiple Penalties and Multiple Local Surrogates for Expensive Constrained Optimization [J].
Li, Genghui ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (04) :769-778
[65]   A Three-Level Radial Basis Function Method for Expensive Optimization [J].
Li, Genghui ;
Zhang, Qingfu ;
Lin, Qiuzhen ;
Gao, Weifeng .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (07) :5720-5731
[66]  
Li J, 2002, 2002 37TH INTERSOCIETY ENERGY CONVERSION ENGINEERING CONFERENCE (IECEC), P319
[67]   Surrogate-Assisted Hybrid-Model Estimation of Distribution Algorithm for Mixed-Variable Hyperparameters Optimization in Convolutional Neural Networks [J].
Li, Jian-Yu ;
Zhan, Zhi-Hui ;
Xu, Jin ;
Kwong, Sam ;
Zhang, Jun .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (05) :2338-2352
[68]   Generation-Level Parallelism for Evolutionary Computation: A Pipeline-Based Parallel Particle Swarm Optimization [J].
Li, Jian-Yu ;
Zhan, Zhi-Hui ;
Liu, Run-Dong ;
Wang, Chuan ;
Kwong, Sam ;
Zhang, Jun .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (10) :4848-4859
[69]   Boosting Data-Driven Evolutionary Algorithm With Localized Data Generation [J].
Li, Jian-Yu ;
Zhan, Zhi-Hui ;
Wang, Chuan ;
Jin, Hu ;
Zhang, Jun .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (05) :923-937
[70]   Data-Driven Evolutionary Algorithm With Perturbation-Based Ensemble Surrogates [J].
Li, Jian-Yu ;
Zhan, Zhi-Hui ;
Wang, Hua ;
Zhang, Jun .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (08) :3925-3937