A novel non-dominated sorting algorithm

Authors:
Gaurav Verma;Arun Kumar;Krishna K. Mishra
Affiliations:
NetApp India Pvt Ltd, Bangalore, India;Citrix Systems Pvt Ltd, Bangalore, India;Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, India
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 6
Cited 0

On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
A critical review of multi-objective optimization in data mining: a position paper

ACM SIGKDD Explorations Newsletter
Multi-objective evolutionary algorithms based on the summation of normalized objectives and diversified selection

Information Sciences: an International Journal
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many multi-objective evolutionary algorithms (MOEA) require non-dominated sorting of the population. The process of non-dominated sorting is one of the main time consuming parts of MOEA. The performance of MOEA can be improved by designing efficient non-dominated sorting algorithm. The paper proposes Novel Non-dominated Sorting algorithm (NNS). NNS algorithm uses special arrangement of solutions which in turn helps to reduce total number of comparisons among solutions. Experimental analysis and comparison study show that NNS algorithm improves the process of non-dominated sorting for large population size with increasing number of objectives.