An Expensive Multi-objective Optimization Algorithm Based on Regional Density Ratio

被引:0
|
作者
Jiang, Zijian [1 ]
Sun, Chaoli [1 ]
Liu, Xiaotong [2 ]
Li, Jing [2 ]
Wang, Kexin [3 ]
机构
[1] Taiyuan Univ Sci & Technol, Sch Comp Sci & Technol, Taiyuan 030024, Peoples R China
[2] Taiyuan Univ Sci & Technol, Sch Elect Informat Engn, Taiyuan 030024, Peoples R China
[3] 2nd Engn Co Ltd, China Railway 12th Bur Grp, Taiyuan 030024, Peoples R China
来源
ADVANCES IN SWARM INTELLIGENCE, PT I, ICSI 2024 | 2024年 / 14788卷
基金
中国国家自然科学基金;
关键词
Expensive Optimization Problems; Surrogate-assisted Evolutionary Algorithms; Semi-supervised Learning; APPROXIMATION;
D O I
10.1007/978-981-97-7181-3_33
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Training surrogate models with high quality often requires a sufficient quantity of labelled data with a balanced distribution. However, obtaining enough labelled solutions for expensive optimization problems is challenging, let alone achieving a uniformly distributed training dataset. In this paper, we propose an expensive multi-objective evolutionary algorithm based on regional density ratio (MOEA-RDR) for solving computationally expensive problems. In MOEA-RDR, a new evaluation metric, integrating the uncertainty measures of Gaussian process models with the underlying assumptions of semi-supervised techniques, is introduced to select unlabelled solutions to participate in the training of surrogate models. A number of experiments are conducted on WFG test problems, and the experimental results show that our proposed method is more efficient than four state-of-the-art algorithms for solving computationally expensive multi-objective problems.
引用
收藏
页码:418 / 429
页数:12
相关论文
共 50 条
  • [1] An Expensive Multi-Objective Optimization Algorithm Based on Decision Space Compression
    Liu, Haosen
    Gu, Fangqing
    Cheung, Yiu-Ming
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2021, 35 (09)
  • [2] A trust-region-like algorithm for expensive multi-objective optimization
    Liu, Hongwei
    Zhou, Changcong
    Liu, Fuchao
    Duan, Zunyi
    Zhao, Haodong
    APPLIED SOFT COMPUTING, 2023, 148
  • [3] A bagging-based surrogate-assisted evolutionary algorithm for expensive multi-objective optimization
    Liu, Yuanchao
    Liu, Jianchang
    Tan, Shubin
    Yang, Yongkuan
    Li, Fei
    NEURAL COMPUTING & APPLICATIONS, 2022, 34 (14) : 12097 - 12118
  • [4] A classification surrogate-assisted multi-objective evolutionary algorithm for expensive optimization
    Li, Jinglu
    Wang, Peng
    Dong, Huachao
    Shen, Jiangtao
    Chen, Caihua
    KNOWLEDGE-BASED SYSTEMS, 2022, 242
  • [5] Domination-Based Ordinal Regression for Expensive Multi-Objective Optimization
    Yu, Xunzhao
    Yao, Xin
    Wang, Yan
    Zhu, Ling
    Filev, Dimitar
    2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 2058 - 2065
  • [6] Multi-stage dimension reduction for expensive sparse multi-objective optimization problems
    Tan, Zheng
    Wang, Handing
    Liu, Shulei
    NEUROCOMPUTING, 2021, 440 : 159 - 174
  • [7] An exploitation-enhanced multi-objective efficient global optimization algorithm for expensive aerodynamic shape optimizations
    Deng, Feng
    Qin, Ning
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING, 2022, 236 (07) : 1408 - 1421
  • [8] Handling expensive multi-objective optimization problems with a cluster-based neighborhood regression model
    Chen, Zefeng
    Zhou, Yuren
    He, Xiaoyu
    APPLIED SOFT COMPUTING, 2019, 80 : 211 - 225
  • [9] AN ALGORITHM FOR MULTI-OBJECTIVE EFFICIENT PARAMETRIC OPTIMIZATION
    Weaver-Rosen, Jonathan M.
    Malak, Richard J., Jr.
    PROCEEDINGS OF ASME 2022 INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, IDETC-CIE2022, VOL 3B, 2022,
  • [10] An Algorithm for Multi-Objective Efficient Parametric Optimization
    Weaver-Rosen, Jonathan M.
    Malak, Richard J.
    JOURNAL OF MECHANICAL DESIGN, 2023, 145 (03)