Surrogate-assisted multi-objective optimization via knee-oriented Pareto front estimation

被引:16
作者
Tang, Junfeng [1 ,2 ]
Wang, Handing [1 ,2 ]
Xiong, Lin [3 ]
机构
[1] Xidian Univ, Sch Artificial Intelligence, Xian 710071, Peoples R China
[2] Xidian Univ, Collaborat Innovat Ctr Quantum Informat Shaanxi Pr, Xian 710071, Peoples R China
[3] Xidian Univ, SenseTime Joint Lab Smart Hlth Care, Xian 710000, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective optimization; Knee solutions; Expensive optimization; Pareto front estimation; Kriging; Evolutionary algorithm; Efficient global optimization; MANY-OBJECTIVE OPTIMIZATION; EVOLUTIONARY ALGORITHM;
D O I
10.1016/j.swevo.2023.101252
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In preference-based multi-objective optimization, knee solutions are termed as the implicit preferred promising solution, particularly when users have trouble in articulating any sensible preferences. However, finding knee solutions by existing posteriori knee identification methods is hard when the function evaluations are expensive, because the computational budget wastes on non-knee solutions. Although a number of knee-oriented multi-objective evolutionary algorithms have been proposed to overcome this issue, they still demand massive function evaluations. Therefore, we propose a surrogate-assisted evolutionary multi -objective optimization algorithm via knee-oriented Pareto front estimation, which employs surrogate models to replace most of the expensive evaluations. The proposed algorithm uses a Pareto front estimation method and a cooperative knee point identification method to predict the potential knee vector. Then, based on the potential knee vector, the aggregated function with an error-tolerant assignment converts the original problem into a single-objective optimization problem for an efficient optimizer. We perform the proposed algorithm on 2-/3-objective problems and experimental results demonstrate that the proposed algorithm outperforms the state-of-the-art knee identification evolutionary algorithms on most test problems within a limited computational budget.
引用
收藏
页数:15
相关论文
共 57 条
[1]  
Arthur D, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1027
[2]   ; Bridging the Gap: Many-Objective Optimization and Informed Decision-Making [J].
Bhattacharjee, Kalyan Shankar ;
Singh, Hemant Kumar ;
Ryan, Michael ;
Ray, Tapabrata .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (05) :813-820
[3]   A Study on Performance Metrics to Identify Solutions of Interest from a Trade-Off Set [J].
Bhattacharjee, Kalyan Shankar ;
Singh, Hemant Kumar ;
Ray, Tapabrata .
ARTIFICIAL LIFE AND COMPUTATIONAL INTELLIGENCE, ACALCI 2016, 2016, 9592 :66-77
[4]   A Python']Python surrogate modeling framework with derivatives [J].
Bouhlel, Mohamed Amine ;
Hwang, John T. ;
Bartoli, Nathalie ;
Lafage, Remi ;
Morlier, Joseph ;
Martins, Joaquim R. R. A. .
ADVANCES IN ENGINEERING SOFTWARE, 2019, 135
[5]   Finding knees in multi-objective optimization [J].
Branke, E ;
Deb, K ;
Dierolf, H ;
Osswald, M .
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII, 2004, 3242 :722-731
[6]  
Broomhead D. S., 1988, Complex Systems, V2, P321
[7]   Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems [J].
Chiu, Wei-Yu ;
Yen, Gary G. ;
Juan, Teng-Kuei .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (06) :972-985
[8]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[9]  
Das I, 1999, STRUCT OPTIMIZATION, V18, P107, DOI 10.1007/s001580050111
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197