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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, pp. 33–43. John Wiley & Sons, Ltd (2000/2001)
Deb, K., Pratab, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. TIK-Report 103. ETH Zentrum, Gloriastrasse 35, CH-8092 Zurich, Switzerland (1999)
Shi, C., Li, Y., Kang, L.S.: A New Simple and Highly Efficient multi-objective Optimal Evolutionary Algorithm. In: Proceedings of 2003 IEEE Conference on Evolutionary Computation, Australia (2003)
Kung, H., Luccio, F., Preparata, F.: On finding the maxima of a set of vectors. Journal of the Association Computing Machinery 22(4), 469–476 (1975)
Freitas, A.A.: A critical review of multi-objective optimization in data mining: a position paper. SIGKDD Explorations 6(2), 77–86 (2004)
Shi, C., Chen, M., Shi, Z.: A Fast Non-dominated Sorting Algorithm. In: International Conference on Neural Networks and Brain, ICNN&B 2005, vol. 2, pp. 1605–1610 (2005)
Jensen, M.T.: Reducing the run-time complexity of multi-objective EAs: The NSGA-II and other algorithms. IEEE Transactions on Evolutionary Computation 7, 502–515 (2003)
Qu, B.Y., Suganthan, P.N.: Multi-Objective Evolutionary Algorithms based on the Summation of Normalized Objectives and Diversified Selection. Information Sciences 180(17), 3170–3181 (2010)
Qu, B.-Y., Suganthan, P.N.: Multi-Objective Differential Evolution based on the Summation of Normalized Objectives and Improved Selection Method. In: Proc. of Symposium on Differential Evolution, Paris, France, April 2011
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verma, G., Kumar, A., Mishra, K.K. (2011). A Novel Non-dominated Sorting Algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-27172-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27171-7
Online ISBN: 978-3-642-27172-4
eBook Packages: Computer ScienceComputer Science (R0)