A Novel Non-dominated Sorting Algorithm
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.
KeywordsDifferential Evolution Pareto Front Large Population Size Current Element Strength Pareto Evolutionary Algorithm
Unable to display preview. Download preview PDF.
- 1.Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, pp. 33–43. John Wiley & Sons, Ltd (2000/2001)Google Scholar
- 3.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)Google Scholar
- 4.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)Google Scholar
- 7.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)Google Scholar
- 8.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)Google Scholar
- 10.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 2011Google Scholar