Modified non-dominated sorting genetic algorithm III with fine final level selection

Dominance resistance is a challenge for Pareto-based multi-objective evolutionary algorithms to solve the high-dimensional optimization problems. The Non-dominated Sorting Genetic Algorithm III (NSGA-III) still has such disadvantage even though it is recognized as an algorithm with good performance for many-objective problems. Thus, a variation of NSGA-III algorithm based on fine final level selection is proposed to improve convergence. The fine final level selection is designed in this way. The theta-dominance relation is used to sort the solutions in the critical layer firstly. Then I-SDE index and favor convergence are employed to evaluate convergence of individuals for different situations. And some better solutions are selected finally. The effectiveness of our proposed algorithm is validated by comparing with nine state-of-the-art algorithms on the Deb-Thiele-Laumanns-Zitzler and Walking-Fish-Group test suits. And the optimization objectives are varying from 3 to 15. The performance is evaluated by the inverted generational distance (IGD), hypervolume (HV), generational distance (GD). The simulation results show that the proposed algorithm has an average improvement of 55.4%, 60.0%, 63.1% of 65 test instances for IGD, HV, GD indexes over the original NSGA-III algorithm. Besides, the proposed algorithm obtains the best performance by comparing 9 state-of-art algorithms in HV, GD indexes and ranks third for IGD indicator. Therefore, the proposed algorithm can achieve the advantages over the benchmarks.