A Knee Point‐Driven Many‐Objective Evolutionary Algorithm with Adaptive Switching Mechanism

Abstract

The Pareto dominance‐based evolutionary algorithms can effectively address multiobjective optimization problems (MOPs). However, when dealing with many‐objective optimization problems with more than three objectives (MaOPs), the Pareto dominance relationships cannot effectively distinguish the nondominated solutions in high‐dimensional spaces. With the increase of the number of objectives, the proportion of dominance‐resistant solutions (DRSs) in the population rapidly increases, which leads to insufficient selection pressure. In this paper, to address the challenges on MaOPs, a knee point‐driven many‐objective evolutionary algorithm with adaptive switching mechanism (KPEA) is proposed. In KPEA, the knee points determined by an adaptive strategy are introduced for not only mating selection but also environmental selection, which increases the probability of generating excellent offspring. In addition, to remove dominance‐resistant solutions (DRSs) in the population, an interquartile range method is adopted, which enhances the selection pressure. Moreover, a novel adaptive switching mechanism between angle‐based selection and penalty for selecting solutions is proposed, which is aimed at achieving a balance between convergence and diversity. To validate the performance of KPEA, it is compared with five state‐of‐the‐art many‐objective evolutionary algorithms. All algorithms are evaluated on 20 benchmark problems, i.e., WFG1‐9, MaF1, and MaF4‐13 with 3, 5, 8, and 10 objectives. The experimental results demonstrate that KPEA outperforms the compared algorithms in terms of HV and IGD in most of the test instances.