Rank-Based Learning and Local Model-Based Evolutionary Algorithm for High-Dimensional Expensive Multiobjective Problems

View at publisher
Authors: Guodong Chen, Jiu Jimmy Jiao, Xiaoming Xue, Zhongzheng Wang
Cited by: 2
References: 59

Abstract

Surrogate-assisted evolutionary algorithms (SAEAs) have been widely developed to solve complex and computationally expensive multiobjective optimization problems (EMOPs) in recent years. However, when dealing with high-dimensional optimization problems in decision space, the performance of these surrogate-assisted multiobjective evolutionary algorithms (MOEAs) deteriorates drastically. In this work, a novel classifier-assisted rank-based learning and local model-based multiobjective evolutionary algorithm (CLMEA) is proposed for high-dimensional EMOPs. CLMEA makes full use of the uncertainty of solutions in the decision space and objective space to explore the uncertain but informative space toward high-dimensional problems. Specifically, the offspring in different ranks uses rank-based learning strategy to generate more promising and informative candidates for function evaluations (FEs). To reduce the search region of high-dimensional problems and maintain the diversity of solutions, the most uncertain sample point from the nondominated solutions measured by the crowding distance is selected as the center to conduct local search. The experimental results of benchmark problems and a real-world application on geothermal reservoir heat extraction optimization demonstrate superior performance of CLMEA compared with the state-of-the-art surrogate-assisted MOEAs. The source code for this work is available athttps://github.com/JellyChen7/CLMEA

Fields of Study & Subjects

Advanced Multi-Objective Optimization Algorithms Process Optimization and Integration Reservoir Engineering and Simulation Methods

Publication details

Journal / source
IEEE Transactions on Systems Man and Cybernetics Systems
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
56
Issue
5
Pages
3272–3285
Publication date
4 February 2026