A twin-archive guided decomposition based multi/many-objective evolutionary algorithm

被引:15
|
作者
Raju, Sri Srinivasa [1 ]
Mallipeddi, Rammohan [2 ]
Das, Kedar Nath [1 ]
机构
[1] Natl Inst Technol Silchar, Dept Math, Silchar, India
[2] Kyungpook Natl Univ, Sch Elect Engn, Dept Artificial Intelligence, Daegu, South Korea
基金
新加坡国家研究基金会;
关键词
Decomposition; Evolutionary algorithm; Weight vector adaptation; Nadir point; Archive guided; Many objective; MOEA/D;
D O I
10.1016/j.swevo.2022.101082
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Decomposition-based Multi-Objective Evolutionary Algorithms (DMOEAs) gained popularity due to their ability to handle Multi/Many-objective Optimization Problems (MOPs/MaOPs). On the other hand, the weight vector adaptation strategy in DMOEAs is an essential ingredient for better performance, especially when dealing with MaOPs with irregular Pareto Front (PF). In general, an effective weight vector adaptation strategy faces challenges like identification of ineffective weight vectors, the proper timing and frequency of adaptation, reallocation of ineffective weight vectors and effective estimation of reference points. DMOEAs proposed in the literature try to address a subset of these issues, but fail to handle all of them simultaneously. In this paper, we propose a DMOEA namely 'A Twin-Archive Guided Decomposition based Multi/Many-objective Evolutionary Algorithm' (TAG-DMOEA) that basically employs two archives to update weight vectors and to estimate nadir point, separately. The better performance of TAG-DMOEA is validated over 10 representative state-of-the-art algorithms on 16 test problems with the number of objectives ranging from 2 to 10. The empirical results demonstrate the effectiveness of TAG-DMOEA on MOPs/MaOPs in both regular and irregular PFs.
引用
收藏
页数:15
相关论文
共 50 条
  • [11] Decomposition and cluster based expensive many-objective evolutionary algorithm
    Xu S.-S.
    Li J.-H.
    Li L.
    Li M.
    Kongzhi yu Juece/Control and Decision, 2024, 39 (02): : 440 - 448
  • [12] Decomposition and Dominance Relation Based Many-objective Evolutionary Algorithm
    Zhao Hui
    Wang Tianlong
    Liu Yanzhou
    Huang Cheng
    Zhang Tianqi
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2020, 42 (08) : 1975 - 1981
  • [13] Many-objective evolutionary algorithm based on adaptive weighted decomposition
    Jiang, Siyu
    He, Xiaoyu
    Zhou, Yuren
    APPLIED SOFT COMPUTING, 2019, 84
  • [14] A novel clustering-based evolutionary algorithm with objective space decomposition for multi/many-objective optimization
    Zheng, Wei
    Tan, Yanyan
    Yan, Zeyuan
    Yang, Mingming
    INFORMATION SCIENCES, 2024, 677
  • [15] Hybrid selection based multi/many-objective evolutionary algorithm
    Dutta, Saykat
    Mallipeddi, Rammohan
    Das, Kedar Nath
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [16] Archive Based Multi-Swarm Algorithm for Many-Objective Problems
    Britto, Andre
    Mostaghim, Sanaz
    Pozo, Aurora
    2014 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2014, : 79 - 84
  • [17] Hybrid selection based multi/many-objective evolutionary algorithm
    Saykat Dutta
    Rammohan Mallipeddi
    Kedar Nath Das
    Scientific Reports, 12
  • [18] Two-Archive Evolutionary Algorithm Based on Multi-Search Strategy for Many-Objective Optimization
    Dai, Cai
    IEEE ACCESS, 2019, 7 : 79277 - 79286
  • [19] An evolutionary many-objective algorithm based on decomposition and hierarchical clustering selection
    Sun, Yuehong
    Xiao, Kelian
    Wang, Siqiong
    Lv, Qiuyue
    APPLIED INTELLIGENCE, 2022, 52 (08) : 8464 - 8509
  • [20] Dynamical decomposition and selection based evolutionary algorithm for many-objective optimization
    Bao, Qian
    Wang, Maocai
    Dai, Guangming
    Chen, Xiaoyu
    Song, Zhiming
    APPLIED SOFT COMPUTING, 2023, 141