A diversity ranking based evolutionary algorithm for multi-objective and many-objective optimization

被引:31
作者
Chen, Guoyu [1 ]
Li, Junhua [1 ]
机构
[1] Nanchang Hongkong Univ, Key Lab Jiangxi Prov Image Proc & Pattern Recogni, Nanchang, Jiangxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Evolutionary algorithm; Multi-objective optimization; Many-objective optimization; Reference vector adaptation; Diversity; NONDOMINATED SORTING APPROACH; SELECTION; DECOMPOSITION; PERFORMANCE; MOEA/D;
D O I
10.1016/j.swevo.2019.03.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, a variety of multi-objective evolutionary algorithms (MOEAs) have been proposed in the literature. As pointed out in some recent studies, the performance of most existing MOEAs is sensitive to the Pareto front (PF) shapes of the problem to be solved, and it is difficult for these algorithms to manage diversity on various types of Pareto fronts (PFs) effectively. To address these issues, this paper proposes an evolutionary algorithm based on diversity ranking method for multi-objective and many-objective optimization. The proposed evolutionary algorithm introduces reference vector adaptation method to solve different shapes of Pareto fronts, and proposes the diversity ranking method to manage diversity. The extensive experimental results demonstrate that the proposed algorithm can solve various types of Pareto fronts, surpassing several state-of-the-art evolutionary algorithms for multi-objective and many-objective optimization.
引用
收藏
页码:274 / 287
页数:14
相关论文
共 49 条
[11]  
Deb K., 2002, Proceedings of the Fourth Asia-Pacific Conference on Simulated Evolution and Learning (SEAL '02), P13
[12]  
Deb K., 2001, MULTIOBJECTIVE OPTIM, DOI [10.1002/9780470496947, DOI 10.1002/9780470496947]
[13]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[14]   An Investigation on Preference Order - Ranking Scheme for Multi Objective Evolutionary Optimisation [J].
di Perro, Francesco ;
Khu, Soon-Thiam ;
Savic, Dragan A. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2007, 11 (01) :17-45
[15]  
Fleming PJ, 2005, LECT NOTES COMPUT SC, V3410, P14
[16]   Towards Understanding the Cost of Adaptation in Decomposition-Based Optimization Algorithms [J].
Giagkiozis, Ioannis ;
Purshouse, Robin C. ;
Fleming, Peter J. .
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, :615-620
[17]   Evolutionary algorithms for optimization problems with uncertainties and hybrid indices [J].
Gong, Dun-wei ;
Qin, Na-na ;
Sun, Xiao-yan .
INFORMATION SCIENCES, 2011, 181 (19) :4124-4138
[18]   A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems [J].
Gong, Dunwei ;
Sun, Jing ;
Miao, Zhuang .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :47-60
[19]   Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems [J].
Gong, Dunwei ;
Sun, Jing ;
Ji, Xinfang .
INFORMATION SCIENCES, 2013, 233 :141-161
[20]   Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms [J].
He, Zhenan ;
Yen, Gary G. ;
Zhang, Jun .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (02) :269-285