arrow
返回

A data-driven co-evolutionary exploration algorithm for computationally expensive constrained multi-objective problems

delete2024-09-01
delete1
PRE
AI
王鹏 封面图
王鹏 (Peng Wang) *
H
Huachao Dong
J
Jinglu Li
DOI:10.1016/j.asoc.2024.111857delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Surrogate-assisted multi-objective optimization algorithms have attracted widespread attention due to their outstanding performance in computationally expensive real-world problems. However, there is relatively little research about multi-objective optimization with complex and expensive constraints. Hence, a data-driven coevolutionary exploration (DDCEE) algorithm is presented in this paper for the above-mentioned problems, where Radial Basis Functions are utilized to train dynamically updated surrogate models for each objective and constraint. Specifically, a data-driven co-evolutionary exploration framework is proposed to fully utilize and mine the potential available information of RBF models, and RBF models are constantly updated to guide coevolutionary in discovering valuable feasible regions and achieving global optimization. In co-evolutionary exploration, one population focuses on exploring the entire space without considering constraints, while the other population focuses on exploring feasible regions and collaborating by sharing their respective offspring. Reference vectors are introduced in co-evolutionary exploration to divide the objective space into several subregions for further selection. Furthermore, an adaptive selection of promising samples strategy is presented to reasonably utilize the information of solutions with good convergence and enhance the convergence and diversity of the Pareto front. After comprehensive experiments on constrained multi/many-objective benchmark cases and an engineering application problem, DDCEE shows more stable and impressive performance when compared with five state-of-art algorithms.
Keyword:
Global optimization
Co-evolutionary exploration
Computationally expensive
Constrained multi-objective
Surrogate model
Reference vector

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

N
Northwestern Polytechnical University
学者数:
4.6W
论文数: 3.7W
被引数: 5.3W
引用论文

引用论文

err分享
err收藏
A constrained multi-objective optimization algorithm using an efficient global diversity strategy
err2022-09-14
err10
errOAAI
errLong, Wenyi; Dong, Huachao; Wang, Peng; Huang, Yan; Li, Jinglu; Yang, Xubo; Fu, Chongbo
err分享
err收藏
学者 查看更多内容