A Fast Nondominated Sorting Algorithm

Abstract

The process of nondominated sorting is one of main time-consuming parts of multiobjective evolutionary algorithm (MOEA). Designing a fast nondominated sorting algorithm is crucial to improve the performance of MOEA. The paper uses a Better function to compare solutions, and theoretical analysis shows that the Better function has the properties of general symmetry and transitivity. Based on these properties, the Better nondominated sorting algorithm (BNS) is designed to reduce the comparisons among solutions distinctly. Through the simulation experiments and comparing study, the new algorithm is found to speed up the process of nondominated sorting in deed