Patterns of convergence and bound constraint violation in Differential Evolution on SBOX-COST benchmarking suite

The data sets contain information collected during runs of : DE/rand/1/bin (D=20, N=50, F=0.5, CR=0.5); L-SHADE(D=20, N_init = 18*D) on all 24 test functions from instances 1-5 and 101-110 from the SBOX-COST and BBOB test suites. For the <strong>analysis with fixed budget</strong>, the number of independent runs was 30 and the stopping condition NFE (number of function evaluations) was 5000*D. For the <strong>convergence analysis</strong>, 5 independent runs were used for instances 1-5 of the 24 test functions and there was a combined stopping condition consisting of NFE=10000*D, population size larger than 10, variance of the population greater than 10^(-15) and the difference between the global best optimum and known best greater than 10^(-8).本数据集收录了两类算法运行过程中采集的实验数据：DE/rand/1/bin（参数设置为D=20、N=50、F=0.5、CR=0.5）与L-SHADE（参数设置为D=20、初始种群规模N_init=18×D），测试对象为SBOX-COST与BBOB测试套件中实例编号1-5及101-110的全部24个测试函数。针对**固定预算分析**场景，本次实验共开展30次独立运行，终止条件为函数评估次数（Number of Function Evaluations，简称NFE）达到5000×D。针对**收敛性分析**场景，针对24个测试函数的实例1-5各执行5次独立运行，采用组合式终止规则：函数评估次数NFE=10000×D、种群规模大于10、种群方差大于10^(-15)，且全局最优解与已知最优值的差值大于10^(-8)。