A Comparison of Constraint Handling Techniques on NSGA-II

Publication Type:
Journal Article
Archives of Computational Methods in Engineering, 2021, 28, (5), pp. 3475-3490
Issue Date:
Filename Description Size
Hobbie2021_Article_AComparisonOfConstraintHandlin.pdfPublished version2.62 MB
Adobe PDF
Full metadata record
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.
Please use this identifier to cite or link to this item: