.png){kind=icon}
.png){kind=icon}
Return
AIEA: An Asynchronous Influence-Based Evolutionary Algorithm for Expensive Many-Objective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2024.3501360.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In expensive multi/many-objective optimization problems (EMOPs), the expensive objectives are generally accessed through different simulation tools, leading to different evaluation latencies and unbearable computational time for serial optimization. One promising approach to improve efficiency is to perform simulation and build surrogates separately for each objective in parallel. However, how to improve the model accuracy and select promising candidates without global information are big challenges. To alleviate these problems, this article proposes an asynchronous influence-based SAEA (AIEA) based on the client-server model. Each client approximates an objective and the server takes charge for evolution. To adaptively select promising candidates, the influence degree is introduced in candidate selection, which is calculated in the objective space to judge which candidate has more beneficial influence for evolution. With the selected candidate, the most-uncertain-first strategy is devised in objective selection for asynchronous evaluations and model improvement. To handle incomplete objective values, the nearest neighbor inheritance is adopted for unevaluated objectives. Comprehensive experiments compared with five surrogate-assisted EAs demonstrate the global optimization and scalability of AIEA.
Keywords:
Optimization
Computational modeling
Predictive models
Training data
Data models
Vectors
Servers
Program processors
Evolutionary computation
Distributed databases
Expensive optimization
many-objective optimization problems
parallel and distributed evolutionary computation
surrogate-assisted evolutionary algorithm
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available