A Surrogate-Assisted Evolutionary Framework With Regions of Interests-Based Data Selection for Expensive Constrained Optimization

被引:13
作者
Song, Zhenshou [1 ,2 ]
Wang, Handing [1 ,2 ]
Jin, Yaochu [3 ,4 ]
机构
[1] Xidian Univ, Sch Artificial Intelligence, Xian 710071, Peoples R China
[2] Xidian Univ, Collaborat Innovat Ctr Quantum Informationof Shaan, Xian 710071, Peoples R China
[3] Bielefeld Univ, Fac Technol, Chair Nat Inspired Comp & Engn, Bielefeld, 33615, Germany
[4] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, Surrey, England
来源
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS | 2023年 / 53卷 / 10期
基金
中国国家自然科学基金;
关键词
Data selection; expensive constrained optimization (ECO) framework; search intensity control; surrogate model; DIFFERENTIAL EVOLUTION;
D O I
10.1109/TSMC.2023.3281822
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Optimization problems whose evaluations of the objective and constraints involve costly numerical simulations or physical experiments are referred to as expensive constrained optimization (ECO) problems. Such problems can be solved by evolutionary algorithms (EAs) in conjunction with computationally cheap surrogates that separately approximate the expensive objective and constraint functions. During the process of the ECO, the interested regions of surrogate models for the objective and constraints usually have a small overlap only. Specifically, the surrogate model for the objective function should focus on the prediction accuracy in the promising region, while the models for constraint functions should concentrate on the accuracy at the boundary of the feasible region. However, most existing methods neglect such differences and train those different models using the same training data, barely resulting in satisfactory performance. Therefore, we propose a general framework for solving expensive optimization problems with inequality constraints. In the proposed framework, the objective and constraints are separately trained with two different sets of training data to enhance the prediction accuracy and reliability in the interested regions. A novel infill sampling criterion is tailored to decide whether potentially better or more uncertain solutions should be sampled. Moreover, a new strategy, termed search intensity adjustment, is designed for adjusting the number of search generations on new surrogate models. We attempt to embed three competitive constrained EAs into our framework to verify its generality. The experimental results obtained on numerous benchmark functions from CEC2006, CEC2010, and CEC2017 have demonstrated the superiority of our approach over three state-of-the-art surrogate-assisted EAs.
引用
收藏
页码:6268 / 6280
页数:13
相关论文
共 45 条
[1]  
Box G. E. P., 1987, EMPIRICAL MODEL BUIL
[2]  
Broomhead D. S., 1988, Complex Systems, V2, P321
[3]   A multiobjective optimization-based evolutionary algorithm for constrained optimization [J].
Cai, Zixing ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :658-675
[4]   A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms [J].
Chugh, Tinkle ;
Sindhya, Karthik ;
Hakanen, Jussi ;
Miettinen, Kaisa .
SOFT COMPUTING, 2019, 23 (09) :3137-3166
[5]   A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization [J].
Chugh, Tinkle ;
Jin, Yaochu ;
Miettinen, Kaisa ;
Hakanen, Jussi ;
Sindhya, Karthik .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :129-142
[6]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[7]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[8]   Kriging-assisted teaching-learning-based optimization (KTLBO) to solve computationally expensive constrained problems [J].
Dong, Huachao ;
Wang, Peng ;
Fu, Chongbo ;
Song, Baowei .
INFORMATION SCIENCES, 2021, 556 :404-435
[9]   Self-adaptive fitness formulation for constrained optimization [J].
Farmani, R ;
Wright, JA .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (05) :445-455
[10]   An insight into imbalanced Big Data classification: outcomes and challenges [J].
Fernandez, Alberto ;
del Rio, Sara ;
Chawla, Nitesh V. ;
Herrera, Francisco .
COMPLEX & INTELLIGENT SYSTEMS, 2017, 3 (02) :105-120