Evolutionary Optimization Methods for High-Dimensional Expensive Problems: A Survey

Document Type

Article

Publication Date

5-1-2024

Abstract

Evolutionary computation is a rapidly evolving field and the related algorithms have been successfully used to solve various real-world optimization problems. The past decade has also witnessed their fast progress to solve a class of challenging optimization problems called high-dimensional expensive problems (HEPs). The evaluation of their objective fitness requires expensive resource due to their use of time-consuming physical experiments or computer simulations. Moreover, it is hard to traverse the huge search space within reasonable resource as problem dimension increases. Traditional evolutionary algorithms (EAs) tend to fail to solve HEPs competently because they need to conduct many such expensive evaluations before achieving satisfactory results. To reduce such evaluations, many novel surrogate-assisted algorithms emerge to cope with HEPs in recent years. Yet there lacks a thorough review of the state of the art in this specific and important area. This paper provides a comprehensive survey of these evolutionary algorithms for HEPs. We start with a brief introduction to the research status and the basic concepts of HEPs. Then, we present surrogate-assisted evolutionary algorithms for HEPs from four main aspects. We also give comparative results of some representative algorithms and application examples. Finally, we indicate open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.

Identifier

85190976409 (Scopus)

Publication Title

IEEE/CAA Journal of Automatica Sinica

External Full Text Location

https://doi.org/10.1109/JAS.2024.124320

e-ISSN

23299274

ISSN

23299266

First Page

1092

Last Page

1105

Issue

5

Volume

11

Grant

IFPIP-1532-135-1443

Fund Ref

Ministry of Education

This document is currently not available here.

Share

COinS