arrow
返回

A simple two-stage evolutionary algorithm for constrained multi-objective optimization

delete2021-09-01
delete47
PRE
AI
F
Fei Ming
龚
龚文引 (Wenyin Gong) *
H
Huixiang Zhen
S
Shuijia Li
王玲 封面图
王玲 (Ling Wang) *
Z
Zuowen Liao
DOI:10.1016/j.knosys.2021.107263delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The widespread existence of constrained multi-objective optimization problems (CMOPs) in practical applications encourages researchers to devote more efforts to the development of constrained multi objective evolutionary algorithms (CMOEAs). An efficient way of handling CMOPs is to balance the satisfaction of constrains and the optimization of objective functions. Although many approaches have been designed to this end, most of them are still unable to handle CMOPs with diverse characteristics effectively. To remedy this issue, a simple and generic two-stage framework is proposed in this paper to achieve better efficiency and versatility for CMOPs. Specifically, the whole search process is simply divided into two stages with different purposes: (i) Stage 1 focuses on approaching the unconstrained Pareto front (PF) and storing the obtained feasible solutions in the archive. During stage 1, the archive is updated to promote convergence and diversity; (ii) Stage 2 is mainly designed to obtain the constrained PF of CMOPs. First, the solutions in the archive are used to form the initial population. Afterwards, the constrained Pareto front (CPF) is extensively explored. Based on this framework, a CMOEA, referred to as C-TSEA, is presented. Fifty-seven instances in five benchmark test suites are chosen to evaluate the performance of our approach. Compared with seven advanced CMOEAs, the results demonstrate the superiority or at least competitiveness of C-TSEA. The generality of the proposed framework is also verified by integrating other methods in the proposed framework. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Constrained multi-objective optimization
Evolutionary algorithm
Two-stage framework
Constrained Pareto front

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
C
China University of Geosciences
学者数:
3.7W
论文数: 2.8W
被引数: 4.3W
B
Beibu Gulf University
学者数:
1.4K
论文数: 858
被引数: 19
学者 查看更多机构
引用论文

引用论文

Range-Bounded Adaptive Therapy in Metastatic Prostate Cancer
err2022-10-28
err0
errOAAI
errRenee Brady-Nicholls; Heiko Enderling
err分享
err收藏
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
err2019-02-04
err238
PREAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Huang, Han; Fang, Yi; You, Yugen; Mo, Jiajie; Wei, Caimin; Goodman, Erik
err分享
err收藏
学者 查看更多内容