.png){kind=icon}
返回
A Constraint-Handling Technique for Decomposition-Based Constrained Many-Objective Evolutionary Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2023.3299570.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To solve the constrained many-objective optimization problems (CMaOPs), the tradeoff among conver-gence, diversity, and feasibility is a crucial and challenging task. This article proposes a new constraint-handling technique tailored for decomposition-based many-objective evolutionary algorithms to deal with the CMaOPs effectively. Specifically, the proposed method, namely, constrained penalty boundary intersection (CPBI), is an improved aggregation function based on the penalty boundary intersection. In CPBI, the normalized overall constraint violation (CV) is embedded to pursue feasibility. In this way, by the optimization of CPBI, convergence, diversity, and feasibility can be optimized simul-taneously. Furthermore, the weight of the normalized overall CV is adjusted adaptively based on the feasible ratio of the current population. To evaluate the performance of CPBI, it is combined with three decomposition-based algorithms. Ten benchmark problems with 50 instances are chosen as the test suite. In addition, the proposed method is compared with nine advanced algorithms. Experimental results have demonstrated the promising performance of CPBI for different problems.
Keyword:
Constrained many-objective optimization
constraint-handling technique (CHT)
decomposition
evolutionary algorithm (EA)
penalty boundary intersection
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏
查看更多内容