A Novel Non-Dominated Sorting Approach Based on Dominance Ranking Graph

There are many approaches to non-dominated sorting, but they are computationally expensive when the number of objectives or the number of fronts becomes relatively large. This paper proposes an efficient non-dominated sorting approach based on a dominance ranking graph created in this paper. The approach takes advantages of both the dominated and non-dominated relationships, it is able to efficiently handle the case of large number of objectives/fronts. Experimental results show that the proposed algorithm outperforms its several popular variants in most of the tests.