水准点(测量)
交叉口(航空)
约束(计算机辅助设计)
惩罚法
数学优化
趋同(经济学)
进化算法
分解
计算机科学
算法
边界(拓扑)
约束优化
符号
数学
工程类
几何学
地理
大地测量学
经济
航空航天工程
数学分析
生态学
算术
生物
经济增长
作者
Fei Ming,Wenyin Gong,Ling Wang,Liang Gao
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2023-01-01
卷期号:: 1-11
标识
DOI:10.1109/tsmc.2023.3299570
摘要
To solve the constrained many-objective optimization problems (CMaOPs), the tradeoff among convergence, 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 simultaneously. 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI