Grid Classification-Based Surrogate-Assisted Particle Swarm Optimization for Expensive Multiobjective Optimization

被引:1
作者
Yang, Qi-Te [1 ]
Zhan, Zhi-Hui [1 ,2 ]
Liu, Xiao-Fang [2 ]
Li, Jian-Yu [2 ]
Zhang, Jun [2 ,3 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[2] Nankai Univ, Coll Artificial Intelligence, Tianjin 300350, Peoples R China
[3] Hanyang Univ, Ansan 15588, South Korea
基金
新加坡国家研究基金会;
关键词
Training; Iron; Costs; Optimization; Convergence; Computational modeling; Classification algorithms; Evolutionary computation; expensive multiobjective optimization; grid classification; particle swarm optimization (PSO); surrogate-assisted evolutionary algorithm (SAEA); EVOLUTIONARY OPTIMIZATION; DIFFERENTIAL EVOLUTION; ALGORITHM; COMPUTATION; DRIVEN; NETWORKS;
D O I
10.1109/TEVC.2023.3340678
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
SAEA, mainly including regression-based surrogate-assisted evolutionary algorithms (SAEAs) and classification-based SAEAs, are promising for solving expensive multiobjective optimization problems (EMOPs). Regression-based SAEAs usually use complex regression models to approximate the fitness evaluation, which will suffer from high-training costs to obtain a fine-accuracy surrogate. In contrast, classification-based SAEAs can achieve solution selection via coarse binary relations predicted by classifiers, thus avoiding high requirements in prediction accuracy and training costs. However, most of the binary relations in existing classification-based SAEAs mainly only involve convergence comparison whereas diversity maintenance is neglected. Considering the capacity of the grid technique in maintaining both convergence and diversity, we propose a new classification method called grid classification to discretize the objective space into grids and train a lightweight grid classification-based surrogate (GCS), for which low-training costs are needed. The GCS can evaluate the solution performance in terms of both convergence and diversity simultaneously according to the predicted grid locations, which opens up a new field for follow-up research on classification-based SAEAs. Following this, a GCS-assisted particle swarm optimization algorithm is proposed for tackling EMOPs. Experimental results on widely used benchmark problems (including high-dimensional EMOPs) and a 222-high-dimensional real-world application problem show its competitiveness in terms of both optimization performance and computational cost.
引用
收藏
页码:1867 / 1881
页数:15
相关论文
共 50 条
  • [1] Surrogate-Assisted Multipopulation Particle Swarm Optimizer for High-Dimensional Expensive Optimization
    Liu, Yuanchao
    Liu, Jianchang
    Jin, Yaochu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (07): : 4671 - 4684
  • [2] An adaptive surrogate-assisted particle swarm optimization for expensive problems
    Li, Xuemei
    Li, Shaojun
    SOFT COMPUTING, 2021, 25 (24) : 15051 - 15065
  • [3] Committee-Based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems
    Wang, Handing
    Jin, Yaochu
    Doherty, John
    IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (09) : 2664 - 2677
  • [4] Progressive Sampling Surrogate-Assisted Particle Swarm Optimization for Large-Scale Expensive Optimization
    Wang, Hong-Rui
    Chen, Chun-Hua
    Li, Yun
    Zhang, Jun
    Zhi-Hui-Zhan
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 40 - 48
  • [5] A Classification-Based Surrogate-Assisted Evolutionary Algorithm for Expensive Many-Objective Optimization
    Pan, Linqiang
    He, Cheng
    Tian, Ye
    Wang, Handing
    Zhang, Xingyi
    Jin, Yaochu
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (01) : 74 - 88
  • [6] Surrogate-assisted evolutionary sampling particle swarm optimization for high-dimensional expensive optimization
    Huang, Kuihua
    Zhen, Huixiang
    Gong, Wenyin
    Wang, Rui
    Bian, Weiwei
    NEURAL COMPUTING & APPLICATIONS, 2023,
  • [7] Surrogate-assisted hierarchical particle swarm optimization
    Yu, Haibo
    Tan, Ying
    Zeng, Jianchao
    Sun, Chaoli
    Jin, Yaochu
    INFORMATION SCIENCES, 2018, 454 : 59 - 72
  • [8] Granularity-based surrogate-assisted particle swarm optimization for high-dimensional expensive optimization
    Tian, Jie
    Sun, Chaoli
    Tan, Ying
    Zeng, Jianchao
    KNOWLEDGE-BASED SYSTEMS, 2020, 187
  • [9] A Surrogate-Assisted Clustering Particle Swarm Optimizer for Expensive Optimization Under Dynamic Environment
    Liu, Yuanchao
    Liu, Jianchang
    Zheng, Tianzi
    Yang, Yongkuan
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [10] A surrogate-assisted particle swarm optimization algorithm based on efficient global optimization for expensive black-box problems
    Yang, Zan
    Qiu, Haobo
    Gao, Liang
    Cai, Xiwen
    Jiang, Chen
    Chen, Liming
    ENGINEERING OPTIMIZATION, 2019, 51 (04) : 549 - 566