Evolutionary computation for expensive optimization: a survey

[thumbnail of s11633-022-1317-4.pdf]
s11633-022-1317-4.pdf - Published Version (898kB) | Preview
Available under license: Creative Commons Attribution

Li, Jian-Yu ORCID: 0000-0002-6143-9207, Zhan, Zhi-Hui ORCID: 0000-0003-0862-0514 and Zhang, Jun ORCID: 0000-0001-7835-9871 (2022) Evolutionary computation for expensive optimization: a survey. Machine Intelligence Research, 19. pp. 3-23. ISSN 2731-538X


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.

Dimensions Badge

Altmetric Badge

Item type Article
URI https://vuir.vu.edu.au/id/eprint/46373
DOI 10.1007/s11633-022-1317-4
Official URL https://link.springer.com/article/10.1007/s11633-0...
Subjects Current > FOR (2020) Classification > 4602 Artificial intelligence
Current > FOR (2020) Classification > 4605 Data management and data science
Current > Division/Research > Institute for Sustainable Industries and Liveable Cities
Keywords expensive optimisation problem, algorithm, evolutionary comuputation
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login