DLEA: A dynamic learning evolution algorithm for many-objective optimization

被引:39
作者
Li, Gui [1 ]
Wang, Gai-Ge [1 ,2 ,3 ]
Dong, Junyu [1 ]
Yeh, Wei-Chang [4 ]
Li, Keqin [5 ]
机构
[1] Ocean Univ China, Dept Comp Sci & Technol, Qingdao 266100, Peoples R China
[2] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130012, Peoples R China
[3] Jilin Agr Univ, Coll Informat Technol, Changchun 130118, Peoples R China
[4] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu, Taiwan
[5] SUNY Coll New Paltz, Dept Comp Sci, New Paltz, NY 12561 USA
基金
中国国家自然科学基金;
关键词
Evolutionary algorithms (EAs); Dynamic learning strategy; Many-objective optimization; Performance indicators; PARTICLE SWARM OPTIMIZATION; NONDOMINATED SORTING APPROACH; BEE COLONY ALGORITHM; DECOMPOSITION;
D O I
10.1016/j.ins.2021.05.064
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For many-objective problems, how to maintain the diversity and convergence of the distribution of the solution set over Pareto front (PF) has always been the research emphasis. In the iteration process, the state of population is critical to improve the level of evolution. Therefore, this paper will use two convergence and diversity indicators to further strengthen the usage of evolutionary state information and propose a dynamic learning strategy. In addition, a dynamic learning strategy based many-objective evolutionary algorithm (MaOEA) is proposed, called dynamic learning evolution algorithm (DLEA), which continuously changes the direction of learning: convergence and diversity in the iteration process. The purpose is to make the algorithm prefer to convergence in the early iteration and prefer to diversity when it is close to PF in the late iteration, so that the convergence and diversity of the final solution set can be well maintained. And then, the performance of DLEA is measured by two indicators. Meanwhile, DLEA will be compared with four stateof-the-art algorithms on the DTLZ and MaF, and its performance will be verified on a many-objective combinatorial problem. And the experimental results and Friedman test show that DLEA has great advantages. (c) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:567 / 589
页数:23
相关论文
共 50 条
[1]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   A neighbor-based learning particle swarm optimizer with short-term and long-term memory for dynamic optimization problems [J].
Cao, Leilei ;
Xu, Lihong ;
Goodman, Erik D. .
INFORMATION SCIENCES, 2018, 453 :463-485
[4]   Self-adaptive many-objective meta-heuristic based on decomposition for many-objective conceptual design of a fixed wing unmanned aerial vehicle [J].
Champasak, Pakin ;
Panagant, Natee ;
Pholdee, Nantiwat ;
Bureerat, Sujin ;
Yildiz, Ali Riza .
AEROSPACE SCIENCE AND TECHNOLOGY, 2020, 100
[5]   Hyperplane Assisted Evolutionary Algorithm for Many-Objective Optimization Problems [J].
Chen, Huangke ;
Tian, Ye ;
Pedrycz, Witold ;
Wu, Guohua ;
Wang, Rui ;
Wang, Ling .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (07) :3367-3380
[6]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[7]  
Deb K, 2004, ADV INFO KNOW PROC, P105
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   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
[10]   Solving Multiobjective Optimization Problems in Unknown Dynamic Environments: An Inverse Modeling Approach [J].
Gee, Sen Bong ;
Tan, Kay Chen ;
Alippi, Cesare .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) :4223-4234