An improved NSGA-III algorithm based on elimination operator for many-objective optimization

Abstract

Due to the low selection pressure of the Pareto-dominance relation and the ineffectivity of diversity maintenance schemes in the environmental selection, the classical Pareto-dominance based multi-objective evolutionary algorithms (MOEAs) fail to handle many-objective optimization problems. The recently presented non-dominated sorting genetic algorithm III (NSGA-III) employs the uniformly distributed reference points to significantly promote population diversity, but the convergence based on the Pareto-dominance relation could still be enhanced. For this purpose, an improved NSGA-III algorithm based on elimination operator (NSGA-III-EO) is proposed. In the proposed algorithm, the elimination operator first identifies the reference point with maximum niche count and then employs the penalty-based boundary intersection distance to rank the individuals associated with it. To this end, the selection scheme is used to remove the worse individuals rather than to select the superior individuals. The proposed NSGA-III-EO is tested on a number of well-known benchmark problems with up to fifteen objectives and shows the competitive performance compared with five state-of-the-art MOEAs. Additionally, it is also tested on constrained problems having a large number of objectives and shows good performance.