摘要
One essential issue in surrogate-assisted evolutionary algorithms (SAEAs) is how to evaluate solutions and find candidates for evolution, without resorting to the calculation of the computational-expensive real objective function. While most studies use regression models as surrogate models for SAEAs, some recent work propose to use classification models for single-objective expensive optimization, as classification models are more stable and much easier to train with limited available data. However, for multi-objective expensive optimization problems, it is more challenging to classify the solutions into different levels according to their quality, and thus the use of classification-based surrogate models for multi-objective SAEAs has not been explored in-depth. To this end, in this paper we propose a classification-assisted level-based learning swarm optimizer for expensive multi-objective optimization. First, a preference relationship among individuals taking both Pareto dominance and crowding distance into account is defined to divide the whole population into different quality levels. Then, a classification model is trained as the surrogate. In addition, a selection strategy is devised in decision space to acquire solutions on the sparse part on the Pareto front. Experimental results validate the superiority and efficiency of the proposed algorithm on benchmark test functions.
学科与关键词
- A Classifier-Assisted Level-Based Learning Swarm Optimizer for Expensive OptimizationWei, Feng-Feng; Chen, Wei-Neng*; Yang, Qiang*; Deng, Jeremiah; Luo, Xiao-Nan; Jin, Hu; Zhang, JunIEEE Transactions on Evolutionary Computation, 2021, 25(2): 219-233.被引 49
- Grid Classification-Based Surrogate-Assisted Particle Swarm Optimization for Expensive Multiobjective OptimizationYang, Qi-Te; Zhan, Zhi-Hui*; Liu, Xiao-Fang; Li, Jian-Yu; Zhang, Jun*IEEE Transactions on Evolutionary Computation, 2024, 28(6): 1867-1881.被引 1
- Expensive Multiobjective Optimization by Relation Learning and PredictionHao, Hao; Zhou, Aimin*; Qian, Hong; Zhang, HuIEEE Transactions on Evolutionary Computation, 2022, 26(5): 1157-1170.被引 11
