arrow
返回

Handling Constrained Many-Objective Optimization Problems via Problem Transformation

delete2021-10-01
delete93
delete
OA
AI
R
Ruwang Jiao
S
Sanyou Zeng *
C
Changhe Li *
杨
杨圣祥 (Shengxiang Yang)
Y
Yew-Soon Ong
DOI:10.1109/TCYB.2020.3031642delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Objectives optimization and constraints satisfaction are two equally important goals to solve constrained many-objective optimization problems (CMaOPs). However, most existing studies for CMaOPs can be classified as feasibility-driven-constrained many-objective evolutionary algorithms (CMaOEAs), and they always give priority to satisfy constraints, while ignoring the maintenance of the population diversity for dealing with conflicting objectives. Consequently, the population may be pushed toward some locally feasible optimal or locally infeasible areas in the high-dimensional objective space. To alleviate this issue, this article presents a problem transformation technique, which transforms a CMaOP into a dynamic CMaOP (DCMaOP) for handling constraints and optimizing objectives simultaneously, to help the population cross the large and discrete infeasible regions. The well-known reference-point-based NSGA-III is tailored under the problem transformation model to solve CMaOPs, namely, DCNSGA-III. In this article, epsilon-feasible solutions play an important role in the proposed algorithm. To this end, in DCNSGA-III, a mating selection mechanism and an environmental selection operator are designed to generate and choose high-quality epsilon-feasible offspring solutions, respectively. The proposed algorithm is evaluated on a series of benchmark CMaOPs with three, five, eight, ten, and 15 objectives and compared against six state-of-the-art CMaOEAs. The experimental results indicate that the proposed algorithm is highly competitive for solving CMaOPs.
Keyword:
Statistics
Sociology
Optimization
Convergence
Search problems
Linear programming
Geology
Constrained optimization
evolutionary computation
many-objective optimization
problem transformation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

D
de montfort university
学者数:
2.3K
论文数: 2.7K
被引数: 0
C
China University of Geosciences
学者数:
3.7W
论文数: 2.8W
被引数: 4.3W
N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
学者 查看更多机构
引用论文

引用论文

Range-Bounded Adaptive Therapy in Metastatic Prostate Cancer
err2022-10-28
err0
errOAAI
errRenee Brady-Nicholls; Heiko Enderling
err分享
err收藏
err分享
err收藏
Push and pull search for solving constrained multi-objective optimization problems
err2019-02-01
err342
errOAAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Li, Hui; Wei, Caimin; Zhang, Qingfu; Deb, Kalyanmoy; Goodman, Erik
err分享
err收藏
err分享
err收藏
Tri-Goal Evolution Framework for Constrained Many-Objective Optimization
err2019-01-01
err135
PREAI
errZhou, Yalan; Zhu, Min; Wang, Jiahai; Zhang, Zizhen; Xiang, Yi; Zhang, Jun
err分享
err收藏
学者 查看更多内容