arrow
返回

A constrained multi-objective evolutionary algorithm based on decomposition and dynamic constraint-handling mechanism

delete2020-04-01
delete45
PRE
AI
杨永宽 封面图
杨永宽 (Y. Yang)
J
Jianchang Liu *
S
Shubin Tan
DOI:10.1016/j.asoc.2020.106104delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Constrained multi-objective optimization problems (CMOPs) are common in real-world engineering application, and are difficult to solve because of the conflicting nature of the objectives and many constraints. Some constrained multi-objective evolutionary algorithms (CMOEAs) have been developed for CMOPs, but they still suffer from the problems of easily getting trapped into local optimal solutions and low convergence. This paper introduces a multi-objective evolutionary algorithm based on decomposition and dynamic constraint-handling mechanism (MOEA/D-DCH) to tackle this issue. Firstly, the dynamic constraint-handling mechanism divides the search modes into the unconstrained search mode and the constrained search mode, which are dynamically adjusted by the generation number and the proportion of feasible solutions in the population. This mechanism could lead to a faster convergence than the traditional constraint-handling mechanisms. For the constrained search mode, an improved epsilon constraint-handling method is used to enhance the diversity of the population. Then, an individual update mechanism based on the best feasible solution of each sub-problem is designed to update the feasible individuals for maintaining the convergence of the feasible solutions. Finally, MOEA/D-DCH dynamically regulates the parameters of the differential evolution operator to enhance the local search ability. Experiments on 21 benchmark test functions are conducted to test MOEA/D-DCH and five other typical CMOEAs. Meanwhile, a real-world problem is employed to evaluate the practical performance of MOEA/D-DCH. MOEA/D-DCH achieves significantly better results than the other five algorithms on most of the test problems. The results indicate the effectiveness and competitiveness of MOEA/D-DCH for solving CMOPs. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Constrained multi-objective optimization
MOEA/D
Constraint-handling techniques
Epsilon constraint-handling
Differential evolution
AI总结

AI总结

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

期刊

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

机构

N
northeastern university - china
学者数:
3.2W
论文数: 2.7W
被引数: 37
引用论文

引用论文

Ly‐1 B (B‐1) cells are the main source of B cell‐derived interleukin 10
err2005-11-17
err0
PREAI
errAnne O'garra; Ray Chang; Ning Go; Robin Hastings; Geoffrey Haughton; Maureen Howard
err分享
err收藏
Range-Bounded Adaptive Therapy in Metastatic Prostate Cancer
err2022-10-28
err0
errOAAI
errRenee Brady-Nicholls; Heiko Enderling
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收藏
学者 查看更多内容