An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization

IEEE Transactions on Evolutionary Computation

Volumn 19, Issue 2, 2015, Pages 201-213

  Zhang, Xingyi ^a   Tian, Ye ^a   Cheng, Ran ^b   Jin, Yaochu ^b  

^a ANHUI UNIVERSITY   (China)

^b UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

Computational complexity; evolutionary multiobjective optimization; nondominated sorting; Pareto optimality

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PARETO PRINCIPLE;

COMPUTATIONALLY EFFICIENT; EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; NON-DOMINATED SORTING; NON-DOMINATED SORTING ALGORITHMS; NON-DOMINATED SORTS; PARETO-OPTIMALITY; SORTING ALGORITHM;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84926333292     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2014.2308305     Document Type: Article

References (22)

1. D. W. Corne, N. R. Jerram, J. D. Knowles, and M. J. Oates, "PESA-II: Region-based selection in evolutionary multi-objective optimization," in Proc. Genet. Evol. Comput. Conf., 2001, pp. 283-290.
2. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multi-objective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
3. th Conf. Evol. Methods Des., Optimiz. Contr. Applicat. Industr. Problems, 2001, pp. 95-100.
4. J. D. Knowles and D. W. Corne, "M-PAES: A memetic algorithm for multiobjective optimization," in Proc. IEEE Congr. Evol. Computat., Jul. 2000, pp. 325-332.
5. rd Int. Conf. Evol. Multi-Crit. Optimiz., 2005, pp. 77-91.
6. J. E. Fieldsend, R. M. Everson, and S. Singh, "Using unconstrained elite archives for multiobjective optimization," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 305-323, Jun. 2003.
7. th Conf. Genet. Evol. Comput., 2006, pp. 619-626.
8. D. E. Goldberg, Geneticdd Algorithms in Search, Optimization, and Machine Learning. Boston, MA, USA: Addison-Wesley, 1989.
9. N. Srinivas and K. Deb, "Multiobjective optimization using nondominated sorting in genetic algorithms," Evol. Comput., vol. 2, no. 3, pp. 221-248, 1995.
10. M. T. Jensen, "Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms," IEEE Trans. Evol. Comput., vol. 7, no. 5, pp. 503-515, Oct. 2003.
11. th Int. Conf. Natural Comput., 2008, pp. 391-395.
12. K. M. Clymont and E. Keedwell, "Deductive sort and climbing sort: New methods for non-dominated sorting," Evol. Comput., vol. 20, no. 1, pp. 1-26, 2012.
13. H. Fang, Q. Wang, Y. Tu, and M. F. Horstemeyer, "An efficient nondominated sorting method for evolutionary algorithms," Evol. Comput., vol. 16, no. 3, pp. 355-384, 2008.
14. K. Deb, "An efficient constraint handling method for genetic algorithms,"Comput. Methods Appl. Mech. Eng., vol. 186, nos. 2-4, pp. 311-338, 2000.
15. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler, "Combining convergence and diversity in evolutionary multiobjective optimization," Evol. Comput., vol. 10, no. 3, pp. 263-282, 2002.
16. rd Int. Conf. Evol. Multi-Crit. Optimiz., 2005, pp. 47-61.
17. C. Shi, M. Chen, and Z. Shi, "A fast nondominated sorting algorithm,"in Proc. Int. Conf. Neural Netw. Brain, 2005, pp. 1605-1610.
18. X. Zhou, J. Shen, and J. Shen, "An immune recognition based algorithm for finding non-dominated set in multi-objective optimization,"in Proc. IEEE Pacific-Asia Workshop Comput. Intell. Industr. Applicat., Dec. 2008, pp. 305-310.
19. J. Zheng, C. X. Ling, Z. Shi, and Y. Xie, "Some discussions about MOGAs: Individual relations, non-dominated set, and application on automatic negotiation," in Proc. IEEE Congr. Evol. Comput., Jun. 2004, pp. 706-712.
20. rd Int. Conf. Natural Comput., 2007, pp. 436-440.
21. J. W. J. Williams, "Algorithm 232: Heapsort," Commun. ACM, vol. 7, no. 6, pp. 347-348, 1964.
22. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, "Scalable multiobjective optimization test problems," in Proc. IEEE Congr. Evol. Comput., May 2002, pp. 825-830.