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 条
[31]   Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems [J].
Gong, Dunwei ;
Sun, Jing ;
Ji, Xinfang .
INFORMATION SCIENCES, 2013, 233 :141-161
[32]  
Gu FQ, 2012, INT J INNOV COMPUT I, V8, P3677
[33]   Many-Objective Evolutionary Algorithm: Objective Space Reduction and Diversity Improvement [J].
He, Zhenan ;
Yen, Gary G. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (01) :145-160
[34]  
Hughes EJ, 2003, IEEE C EVOL COMPUTAT, P2678
[35]   MSOPS-II: A general-purpose Many-Objective optimiser [J].
Hughes, Evan J. .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :3944-3951
[36]  
Ishibuchi H., 2008, P 10 ANN C GEN EV CO, P649, DOI DOI 10.1145/1389095.1389225
[37]   Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes [J].
Ishibuchi, Hisao ;
Setoguchi, Yu ;
Masuda, Hiroyuki ;
Nojima, Yusuke .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (02) :169-190
[38]   Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems [J].
Ishibuchi, Hisao ;
Akedo, Naoya ;
Nojima, Yusuke .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (02) :264-283
[39]   Use of biased neighborhood structures in multiobjective memetic algorithms [J].
Ishibuchi, Hisao ;
Hitotsuyanagi, Yasuhiro ;
Tsukamoto, Noritaka ;
Nojima, Yusuke .
SOFT COMPUTING, 2009, 13 (8-9) :795-810
[40]  
Ishibuchi H, 2008, IEEE C EVOL COMPUTAT, P2419, DOI 10.1109/CEC.2008.4631121