An adaptive stochastic ranking-based tournament selection method for differential evolution

被引:1
|
作者
Xia, Dahai [1 ]
Wu, Xinyun [1 ]
Yan, Meng [1 ]
Xiong, Caiquan [1 ]
机构
[1] Hubei Univ Technol, Sch Comp Sci, Nanli Rd, Wuhan 430068, Hubei, Peoples R China
来源
JOURNAL OF SUPERCOMPUTING | 2024年 / 80卷 / 01期
关键词
Differential evolution; Mutation operator; Adaptive stochastic ranking; Tournament selection; Diversity measurement; ALGORITHM;
D O I
10.1007/s11227-023-05390-1
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The selection method of individuals is a crucial step in the mutation operator of differential evolution (DE). Typically, methods that select individuals with better fitness values are used to increase the exploitation ability of the algorithm. However, some researches have shown that incorporating distribution information of target space to measure diversity can improve the exploration ability of the algorithm. With this concept in mind, this paper presents an innovative approach called the adaptive stochastically ranking-based tournament selection method (ASR-TS). ASR-TS initially uses tournament selection and subsequently stochastically ranks selected individuals based on fitness and diversity measurements, leading to the determination of the tournament's winner. Furthermore, the stochastic ranking parameter is adaptively set based on the success rate of the previous generation to strike a balance between the exploitation and exploration abilities of the algorithm. The proposed ASR-TS method was tested on CEC 2013 benchmark functions in several original and improved DEs. To further validate the effectiveness of this method, the ASR-TS method was also tested on CEC 2022 benchmark functions as well as real-world problems. The experimental results demonstrate that the proposed ASR-TS method outperformed various other methods by a significant margin, which proves its efficiency and effectiveness in balancing exploration and exploitation.
引用
收藏
页码:20 / 49
页数:30
相关论文
共 50 条
  • [1] 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
  • [2] Differential evolution improvement by adaptive ranking-based constraint handling technique
    Yuanrui Li
    Qiuhong Zhao
    Kaiping Luo
    [J]. Soft Computing, 2023, 27 : 11485 - 11504
  • [3] Differential evolution improvement by adaptive ranking-based constraint handling technique
    Li, Yuanrui
    Zhao, Qiuhong
    Luo, Kaiping
    [J]. SOFT COMPUTING, 2023, 27 (16) : 11485 - 11504
  • [4] Proximity ranking-based multimodal differential evolution
    Zhang, Junna
    Chen, Degang
    Yang, Qiang
    Wang, Yiqiao
    Liu, Dong
    Jeon, Sang-Woon
    Zhang, Jun
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2023, 78
  • [5] Differential Evolution With Ranking-Based Mutation Operators
    Gong, Wenyin
    Cai, Zhihua
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (06) : 2066 - 2081
  • [6] 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
  • [7] Ranking-based hierarchical random mutation in differential evolution
    Zhong, Xuxu
    Duan, Meijun
    Cheng, Peng
    [J]. PLOS ONE, 2021, 16 (02):
  • [8] Ranking-Based Feature Selection Method for Dynamic Belief Clustering
    Ben Hariz, Sarra
    Elouedi, Zied
    [J]. ADAPTIVE AND INTELLIGENT SYSTEMS, 2011, 6943 : 308 - 319
  • [9] RANKING-BASED DIFFERENTIAL EVOLUTION FOR LARGE-SCALE CONTINUOUS OPTIMIZATION
    Guo, Li
    Li, Xiang
    Gong, Wenyin
    [J]. COMPUTING AND INFORMATICS, 2018, 37 (01) : 49 - 75
  • [10] Neighborhood Ranking-Based Feature Selection
    Ipkovich, Adam
    Abonyi, Janos
    [J]. IEEE ACCESS, 2024, 12 : 20152 - 20168