A multi-modal multi-objective evolutionary algorithm based on scaled niche distance

被引:9
作者
Cao, Jie [1 ,3 ]
Qi, Zhi [2 ,3 ]
Chen, Zuohan [1 ,3 ]
Zhang, Jianlin [1 ,3 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Peoples R China
[2] Lanzhou Univ Technol, Coll Elect & Informat Engn, Lanzhou 730050, Peoples R China
[3] Lanzhou Univ Technol, Gansu Engn Res Ctr Mfg Informat, Lanzhou 730050, Peoples R China
关键词
Multi -modal problem; Multi -objective optimization; Diversity fitness; Niche; Diversity archives; NONDOMINATED SORTING APPROACH; DECOMPOSITION; 2-ARCHIVE;
D O I
10.1016/j.asoc.2023.111226
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-modal multi-objective optimization problems (MMOPs) refer to several solutions in the decision space that share the same or similar objective value. Balancing the diversity of the objective space and decision space while maintaining the convergence of the population is a challenging and important problem. To address this issue, a novel multi-modal multi-objective evolutionary algorithm (MMEA) named MMEA-SND is proposed in this study. In the MMEA-SND, to locate Pareto-optimal solutions, and improve the diversity of solutions in the decision space, a diversity fitness is designed by the niche method to calculate the fitness of solutions in the diversity archive. In order to balance the diversity of solutions in the objective space and decision space, a scaled niche distance (SND) method is proposed in environmental selection. In this context, SND are utilized to measure the distances between each solution in the objective space and decision space. Furthermore, a parameter is implemented to avoid disregarding locally optimal solutions. To verify the performance of MMEA-SND, six state-ofthe-art MMEAs are adopted to make a comparison on 42 benchmark problems. The experimental results show that the proposed MMEA-SND achieves a competitive performance in solving MMOPs.
引用
收藏
页数:20
相关论文
共 50 条
[1]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[2]   A decomposition-based many-objective evolutionary algorithm updating weights when required [J].
de Farias, Lucas R. C. ;
Araujo, Aluizio F. R. .
SWARM AND EVOLUTIONARY COMPUTATION, 2022, 68
[3]   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
[4]   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
[5]   Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems [J].
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :205-230
[6]   Large-scale multimodal multiobjective evolutionary optimization based on hybrid hierarchical clustering [J].
Ding, Zhuanlian ;
Cao, Lve ;
Chen, Lei ;
Sun, Dengdi ;
Zhang, Xingyi ;
Tao, Zhifu .
KNOWLEDGE-BASED SYSTEMS, 2023, 266
[7]   Zoning Search With Adaptive Resource Allocating Method for Balanced and Imbalanced Multimodal Multi-Objective Optimization [J].
Fan, Qinqin ;
Ersoy, Okan K. .
IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2021, 8 (06) :1163-1176
[8]  
Gao W., 2022, IEEE Trans. Evol. Comput., P1
[9]   A dynamic neighborhood balancing-based multi-objective particle swarm optimization for multi-modal problems [J].
Gu, Qinghua ;
Wang, Qian ;
Chen, Lu ;
Li, Xiaoguang ;
Li, Xuexian .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 205
[10]   A two-archive model based evolutionary algorithm for multimodal multi-objective optimization problems [J].
Hu, Yi ;
Wang, Jie ;
Liang, Jing ;
Wang, Yanli ;
Ashraf, Usman ;
Yue, Caitong ;
Yu, Kunjie .
APPLIED SOFT COMPUTING, 2022, 119