On the Unbounded External Archive and Population Size in Preference-based Evolutionary Multi-objective Optimization Using a Reference Point

被引:2
|
作者
Tanabe, Ryoji [1 ]
机构
[1] Yokohama Natl Univ, Yokohama, Kanagawa, Japan
关键词
Preference-based evolutionary multi-objective optimization; unbounded external archive; population size; benchmarking; ALGORITHM; DOMINANCE; SELECTION; MOEA/D;
D O I
10.1145/3583131.3590511
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Although the population size is an important parameter in evolutionary multi-objective optimization (EMO), little is known about its influence on preference-based EMO (PBEMO). The effectiveness of an unbounded external archive (UA) in PBEMO is also poorly understood, where the UA maintains all non-dominated solutions found so far. In addition, existing methods for postprocessing the UA cannot handle the decision maker's preference information. In this context, first, this paper proposes a preference-based postprocessing method for selecting representative solutions from the UA. Then, we investigate the influence of the UA and population size on the performance of PBEMO algorithms. Our results show that the performance of PBEMO algorithms (e.g., R-NSGA-II) can be significantly improved by using the UA and the proposed method. We demonstrate that a smaller population size than commonly used is effective in most PBEMO algorithms for a small budget of function evaluations, even for many objectives. We found that the size of the region of interest is a less important factor in selecting the population size of the PBEMO algorithms on real-world problems.
引用
收藏
页码:749 / 758
页数:10
相关论文
共 50 条
  • [1] Investigating normalization in preference-based evolutionary multi-objective optimization using a reference point
    Tanabe, Ryoji
    APPLIED SOFT COMPUTING, 2024, 159
  • [2] Preference-Based Evolutionary Multi-objective Optimization
    Li, Zhenhua
    Liu, Hai-Lin
    PROCEEDINGS OF THE 2012 EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2012), 2012, : 71 - 76
  • [3] A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization
    Thiele, Lothar
    Miettinen, Kaisa
    Korhonen, Pekka J.
    Molina, Julian
    EVOLUTIONARY COMPUTATION, 2009, 17 (03) : 411 - 436
  • [4] Preference-based evolutionary multi-objective optimization in ship weather routing
    Szlapczynska, Joanna
    Szlapczynski, Rafal
    APPLIED SOFT COMPUTING, 2019, 84
  • [5] Periodical Weight Vector Update Using an Unbounded External Archive for Decomposition-Based Evolutionary Multi-Objective Optimization
    Chen, Longcan
    Pang, Lie Meng
    Ishibuchi, Hisao
    Shang, Ke
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [6] Reference point based multi-objective optimization using evolutionary algorithms
    Deb, Kalyanmoy
    Sundar, J.
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 635 - +
  • [7] Preference-based multi-objective evolutionary algorithm with linear combination scalarizing function and reference point adjustment
    Zhao, Peipei
    Wang, Liping
    Fang, Zhaolin
    Pan, Xiaotian
    Qiu, Qicang
    APPLIED SOFT COMPUTING, 2024, 153
  • [8] Periodical Generation Update using an Unbounded External Archive for Multi-Objective Optimization
    Chen, Longcan
    Pang, Lie Meng
    Ishibuchi, Hisao
    Shang, Ke
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1912 - 1920
  • [9] A preference-based multi-objective evolutionary algorithm using preference selection radius
    Jianjie Hu
    Guo Yu
    Jinhua Zheng
    Juan Zou
    Soft Computing, 2017, 21 : 5025 - 5051
  • [10] A preference-based multi-objective evolutionary algorithm using preference selection radius
    Hu, Jianjie
    Yu, Guo
    Zheng, Jinhua
    Zou, Juan
    SOFT COMPUTING, 2017, 21 (17) : 5025 - 5051