A Decomposition-Based Many-Objective Evolutionary Algorithm With Two Types of Adjustments for Direction Vectors

被引:101
作者
Cai, Xinye [1 ,2 ]
Mei, Zhiwei [1 ,2 ]
Fan, Zhun [3 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 210016, Jiangsu, Peoples R China
[2] Collaborat Innovat Ctr Novel Software Technol & I, Nanjing 210023, Jiangsu, Peoples R China
[3] Shantou Univ, Sch Engn, Dept Elect Engn, Shantou 515063, Peoples R China
基金
中国国家自然科学基金;
关键词
Adjustment of direction vectors; convergence; decomposition; diversity; many-objective optimization; NONDOMINATED SORTING APPROACH; MULTIOBJECTIVE OPTIMIZATION; PART I; SELECTION; REDUCTION; DIVERSITY; MOEA/D; SCHEME;
D O I
10.1109/TCYB.2017.2737554
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Decomposition-based multiobjective evolutionary algorithm has shown its advantage in addressing many-objective optimization problem (MaOP). To further improve its convergence on MaOPs and its diversity for MaOPs with irregular Pareto fronts (PFs, e.g., degenerate and disconnected ones), we proposed a decomposition-based many-objective evolutionary algorithm with two types of adjustments for the direction vectors (MaOEA/D-2ADV). At the very beginning, search is only conducted along the boundary direction vectors to achieve fast convergence, followed by the increase of the number of the direction vectors for approximating a more complete PF. After that, a Pareto-dominance-based mechanism is used to detect the effectiveness of each direction vector and the positions of ineffective direction vectors are adjusted to better fit the shape of irregular PFs. The extensive experimental studies have been conducted to validate the efficiency of MaOEA/D-2ADV on many-objective optimization benchmark problems. The effects of each component in MaOEA/D-2ADV are also investigated in detail.
引用
收藏
页码:2335 / 2348
页数:14
相关论文
共 74 条
[41]  
Jaimes AL, 2009, LECT NOTES COMPUT SC, V5467, P423, DOI 10.1007/978-3-642-01020-0_34
[42]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach [J].
Jain, Himanshu ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :602-622
[43]  
Jiang SW, 2011, LECT NOTES ARTIF INT, V7106, P351, DOI 10.1007/978-3-642-25832-9_36
[44]  
Jin Y, 2003, IEEE C EVOL COMPUTAT, P1910
[45]  
Kalboussi Sabrine, 2013, Search Based Software Engineering. 5th International Symposium, SSBSE 2013. Proceedings: LNCS 8084, P245, DOI 10.1007/978-3-642-39742-4_19
[46]  
Knowles J, 2007, LECT NOTES COMPUT SC, V4403, P757
[47]   Combining convergence and diversity in evolutionary multiobjective optimization [J].
Laumanns, M ;
Thiele, L ;
Deb, K ;
Zitzler, E .
EVOLUTIONARY COMPUTATION, 2002, 10 (03) :263-282
[48]  
Le K, 2009, LECT NOTES COMPUT SC, V5467, P231
[49]  
Lee KB, 2011, IEEE C EVOL COMPUTAT, P2506
[50]   Many-Objective Evolutionary Algorithms: A Survey [J].
Li, Bingdong ;
Li, Jinlong ;
Tang, Ke ;
Yao, Xin .
ACM COMPUTING SURVEYS, 2015, 48 (01)