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 条
[1]   Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection [J].
Akhtar, Taimoor ;
Shoemaker, Christine A. .
JOURNAL OF GLOBAL OPTIMIZATION, 2016, 64 (01) :17-32
[2]   A Parallel Surrogate Model Assisted Evolutionary Algorithm for Electromagnetic Design Optimization [J].
Akinsolu, Mobayode O. ;
Liu, Bo ;
Grout, Vic ;
Lazaridis, Pavlos, I ;
Mognaschi, Maria Evelina ;
Di Barba, Paolo .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2019, 3 (02) :93-105
[3]  
Ampellio E, 2016, IEEE C EVOL COMPUTAT, P1157, DOI 10.1109/CEC.2016.7743918
[4]  
[Anonymous], 1995, SAC 95
[5]  
[Anonymous], 2000, P 38 AIAA AEROSPACE
[6]  
Asafuddoula Md, 2013, 2013 IEEE Symposium on Differential Evolution (SDE), P31, DOI 10.1109/SDE.2013.6601439
[7]  
Asafuddoula Md, 2012, AI 2012: Advances in Artificial Intelligence. 25th Australasian Conference. Proceedings, P182, DOI 10.1007/978-3-642-35101-3_16
[8]   A differential evolution algorithm with constraint sequencing: An efficient approach for problems with inequality constraints [J].
Asafuddoula, Md ;
Ray, Tapabrata ;
Sarker, Ruhul .
APPLIED SOFT COMPUTING, 2015, 36 :101-113
[9]   An Improved Self-Adaptive Constraint Sequencing approach for constrained optimization problems [J].
Asafuddoula, Md ;
Ray, Tapabrata ;
Sarker, Ruhul .
APPLIED MATHEMATICS AND COMPUTATION, 2015, 253 :23-39
[10]   A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems [J].
Aydilek, Ibrahim Berkan .
APPLIED SOFT COMPUTING, 2018, 66 :232-249