A many-objective evolutionary algorithm based on bi-direction fusion niche dominance

被引:0
|
作者
Wei, Li-sen [1 ]
Li, Er-chao [2 ]
机构
[1] Lanzhou Univ Technol, Sch Comp Sci & Commun, Lanzhou, Gansu, Peoples R China
[2] Lanzhou Univ Technol, Coll Elect Engn & Informat Engn, Lanzhou 730050, Gansu, Peoples R China
来源
关键词
cone decomposition; nice-based dominance; parallel decomposition; OPTIMIZATION;
D O I
10.1002/cpe.8196
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Although some many-objective optimization algorithms (MaOEAs) have been proposed recently, Pareto dominance-based MaOEAs still cannot effectively balance convergence and diversity in solving many objective optimization problems (MaOPs) due to insufficient selection pressure. To address this problem, a bi-directional fusion niche domination is proposed. This method merges the strengths of cone and parallel decomposition directions in comparing dominations for nondominance stratification within the candidate population, augmenting the selection pressure of population. Subsequently, the crowding distance is introduced as an additional selection criterion to further refine the selection of nondominated individuals within the critical layer. Lastly, a MaOEA based on bi-directional fusion niche dominance (MaOEA/BnD) is proposed, utilizing bi-directional fusion niche dominance and crowding distance as important components of environmental selection. The performance of MaOEA/BnD was compared with five representative MaOEAs in 20 benchmark problems. Experimental results demonstrate that MaOEA/BnD effectively balances convergence and diversity when handling MaOPs with complex Pareto fronts.
引用
收藏
页数:32
相关论文
共 50 条
  • [21] Evolutionary Many-Objective Algorithm Using Decomposition-Based Dominance Relationship
    Chen, Lei
    Liu, Hai-Lin
    Tan, Kay Chen
    Cheung, Yiu-Ming
    Wang, Yuping
    IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (12) : 4129 - 4139
  • [22] A Localized High-Fidelity-Dominance-Based Many-Objective Evolutionary Algorithm
    Saxena, Dhish Kumar
    Mittal, Sukrit
    Kapoor, Sarang
    Deb, Kalyanmoy
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (04) : 923 - 937
  • [23] An Angle-Based Bi-Objective Evolutionary Algorithm for Many-Objective Optimization
    Yang, Feng
    Wang, Shenwen
    Zhang, Jiaxing
    Gao, Na
    Qu, Jun-Feng
    IEEE ACCESS, 2020, 8 : 194015 - 194026
  • [24] An adaptive interval many-objective evolutionary algorithm with information entropy dominance
    Cui, Zhihua
    Qu, Conghong
    Zhang, Zhixia
    Jin, Yaqing
    Cai, Jianghui
    Zhang, Wensheng
    Chen, Jinjun
    Swarm and Evolutionary Computation, 2024, 91
  • [25] Enhanced θ dominance and density selection based evolutionary algorithm for many-objective optimization problems
    Chong Zhou
    Guangming Dai
    Maocai Wang
    Applied Intelligence, 2018, 48 : 992 - 1012
  • [26] A strengthened constrained-dominance based evolutionary algorithm for constrained many-objective optimization
    Zhang, Wei
    Liu, Jianchang
    Liu, Junhua
    Liu, Yuanchao
    Tan, Shubin
    Applied Soft Computing, 2024, 167
  • [27] An α-dominance expandation based algorithm for many-objective optimization
    Liu, Junhua
    Wang, Yuping
    Wang, Xingyin
    Sui, Xin
    Guo, Si
    Liu, Liwen
    2017 13TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2017, : 6 - 10
  • [28] A many-objective evolutionary algorithm with reference points-based strengthened dominance relation
    Gu, Qinghua
    Chen, Huayang
    Chen, Lu
    Li, Xinhong
    Xiong, Neal N.
    INFORMATION SCIENCES, 2021, 554 : 236 - 255
  • [29] Enhanced θ dominance and density selection based evolutionary algorithm for many-objective optimization problems
    Zhou, Chong
    Dai, Guangming
    Wang, Maocai
    APPLIED INTELLIGENCE, 2018, 48 (04) : 992 - 1012
  • [30] Many-objective E-dominance dynamical evolutionary algorithm based on adaptive grid
    Xuezhi Yue
    Zhaolu Guo
    Yali Yin
    Xiaosheng Liu
    Soft Computing, 2018, 22 : 137 - 146