Ranking Center-based NSGA-II

Multi-objective optimization is a branch of computation to solve mathematical optimization problems when conflicting multiple objective functions must be simultaneously optimized. Many population-based algorithms, such as NSGA-II are used to find an optimal Pareto set of solutions in a short time. However, previous research works showed the performance of classic NSGA-II is degraded when solving problems with many objectives (M ≥ 5). In this work, we aim to take advantage of center-based sampling scheme to increase the exploration and exploitation capability of NSGA-II algorithm. This sampling strategy has demonstrated promising results on several single-objective evolutionary algorithms such as GA, DE, and PSO. Recently, a novel clustering center-based strategy has been proposed, which motivated us to utilize center-based sampling scheme in NSGA-II to solve multi-objective optimization problems. The outcomes confirm that the proposed clustering center-based NSGA-II is able to effectively solve CEC-2017 multi-objective benchmark problems with 2, 3, 5, 10, and 15 objectives.