Proximity ranking-based multimodal differential evolution

被引:16
|
作者
Zhang, Junna [1 ,2 ]
Chen, Degang [1 ,2 ]
Yang, Qiang [3 ]
Wang, Yiqiao [4 ]
Liu, Dong [1 ,2 ]
Jeon, Sang-Woon [5 ]
Zhang, Jun [5 ]
机构
[1] Henan Normal Univ, Coll Comp & Informat Engn, Xinxiang, Peoples R China
[2] Key Lab Artificial Intelligence & Personalized Lea, Xinxiang, Peoples R China
[3] Nanjing Univ Informat Sci & Technol, Sch Artificial Intelligence, Nanjing, Peoples R China
[4] Beijing Univ Chinese Med, Sch Management, Beijing, Peoples R China
[5] Hanyang Univ, Dept Elect & Elect Engn, Ansan, South Korea
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
Differential evolution; Multimodal optimization problems; Proximity ranking based individual selection; Multimodal differential evolution; Adaptive local search; MULTIOBJECTIVE OPTIMIZATION; GENETIC ALGORITHM; SWARM OPTIMIZER; MUTATION; STRATEGIES; POPULATION; ENSEMBLE; SEARCH;
D O I
10.1016/j.swevo.2023.101277
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multimodal optimization aiming at locating multiple global optima at a time has received extensive attention from researchers since it can afford multiple choices for decision-makers. To effectively locate as many optima of multimodal optimization problems (MMOPs) as possible, this paper proposes a novel differential evolution framework, named proximity ranking-based multimodal differential evolution (PRMDE). Firstly, a proximity ranking-based individual selection method is proposed to randomly select parent individuals involved in the mutation operation. Specifically, instead of the classical uniform selection, this paper devises a non-linear weight function to calculate the selection probabilities of individuals according to their proximity rankings and then randomly selects parent individuals based on the roulette wheel selection strategy. In this way, each individual is likely mutated by its Euclidian neighbors. Secondly, an adaptive parameter adjustment strategy is further devised for the selection probability calculation, so that the selection probabilities of closer individuals to each target individual gradually increase as the evolution continues. Thirdly, an adaptive local search strategy is designed to carry out the Gaussian distribution based local search adaptively around individuals. In this way, better in-dividuals have higher chances to conduct local search to subtly improve their quality. By means of the cohesive cooperation among the three main mechanisms, PRMDE is expectedly capable of simultaneously locating mul-tiple optima of MMOPs. Theoretically, any mutation strategy can be embedded into PRMDE to deal with MMOPs. Four classical mutation strategies are adopted in this paper to instantiate PRMDE. Experiments carried out on the publicly acknowledged CEC2013 benchmark MMOP set demonstrate that PRMDE is effective to solve MMOPs and attains considerably competitive or even far better optimization performance than several representative and state-of-the-art multimodal optimization methods.
引用
收藏
页数:21
相关论文
共 50 条
  • [1] Differential Evolution With Ranking-Based Mutation Operators
    Gong, Wenyin
    Cai, Zhihua
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (06) : 2066 - 2081
  • [2] A Simple but Efficient Ranking-Based Differential Evolution
    Li, Jiayi
    Yang, Lin
    Yi, Junyan
    Yang, Haichuan
    Todo, Yuki
    Gao, Shangce
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (01): : 189 - 192
  • [3] Ranking-based hierarchical random mutation in differential evolution
    Zhong, Xuxu
    Duan, Meijun
    Cheng, Peng
    [J]. PLOS ONE, 2021, 16 (02):
  • [4] RANKING-BASED DIFFERENTIAL EVOLUTION FOR LARGE-SCALE CONTINUOUS OPTIMIZATION
    Guo, Li
    Li, Xiang
    Gong, Wenyin
    [J]. COMPUTING AND INFORMATICS, 2018, 37 (01) : 49 - 75
  • [5] Differential evolution algorithm with fitness and diversity ranking-based mutation operator
    Cheng, Jianchao
    Pan, Zhibin
    Liang, Hao
    Gao, Zhaoqi
    Gao, Jinghuai
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2021, 61
  • [6] An adaptive stochastic ranking-based tournament selection method for differential evolution
    Dahai Xia
    Xinyun Wu
    Meng Yan
    Caiquan Xiong
    [J]. The Journal of Supercomputing, 2024, 80 : 20 - 49
  • [7] Differential evolution improvement by adaptive ranking-based constraint handling technique
    Yuanrui Li
    Qiuhong Zhao
    Kaiping Luo
    [J]. Soft Computing, 2023, 27 : 11485 - 11504
  • [8] Differential evolution improvement by adaptive ranking-based constraint handling technique
    Li, Yuanrui
    Zhao, Qiuhong
    Luo, Kaiping
    [J]. SOFT COMPUTING, 2023, 27 (16) : 11485 - 11504
  • [9] An adaptive stochastic ranking-based tournament selection method for differential evolution
    Xia, Dahai
    Wu, Xinyun
    Yan, Meng
    Xiong, Caiquan
    [J]. JOURNAL OF SUPERCOMPUTING, 2024, 80 (01): : 20 - 49
  • [10] Solving chemical dynamic optimization problems with ranking-based differential evolution algorithms
    Chen, Xu
    Du, Wenli
    Qian, Feng
    [J]. CHINESE JOURNAL OF CHEMICAL ENGINEERING, 2016, 24 (11) : 1600 - 1608