期刊
ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING
卷 28, 期 5, 页码 3475-3490出版社
SPRINGER
DOI: 10.1007/s11831-020-09525-y
关键词
-
This study focuses on the application of constraint handling techniques in NSGA-II for solving constrained multi-objective optimization problems, comparing seven different penalty constraint techniques and discussing key evaluation metrics. The results indicate variations in the performance of NSGA-II across 13 constrained multi-objective problems.
Almost all real-world and engineering problems involve multi-objective optimization of some sort that is often constrained. To solve these constrained multi-objective optimization problems, constrained multi-objective optimization evolutionary algorithms (CMOEAs) are enlisted. These CMOEAs require specific constraint handling techniques. This study aims to address and test the most successful constraint handling techniques, seven different penalty constraint techniques, as applied to the Non-dominated Sorting Genetic Algorithm II (NSGA-II). In this paper, NSGA-II is chosen because of its high popularity amongst evolutionary algorithms. Inverted Generational Distance and Hypervolume are the main metrics that are discussed to compare the constraint handling techniques. NSGA-II is applied on 13 constrained multi-objective problems known as CF1-CF10, C1-DTLZ1, C2-DTLZ2, and C3-DTLZ4. The result of IGD and HV values are compared and the feasibility proportions of each combination on each problem are shown. The results of simulation present interesting findings that have been presented at the end of paper as discussion and conclusion.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据