School of Management Engineering and Business, Hebei University of Engineering, Handan 056038, China.
School of Marxism, Hebei University of Engineering, Handan 056038, China.
Math Biosci Eng. 2022 Aug 10;19(11):11422-11452. doi: 10.3934/mbe.2022533.
Swarm intelligence algorithms are relatively simple and highly applicable algorithms, especially for solving optimization problems with high reentrancy, high stochasticity, large scale, multi-objective and multi-constraint characteristics. The sparrow search algorithm (SSA) is a kind of swarm intelligence algorithm with strong search capability, but SSA has the drawback of easily falling into local optimum in the iterative process. Therefore, a sine cosine and firefly perturbed sparrow search algorithm (SFSSA) is proposed for addressing this deficiency. Firstly, the Tent chaos mapping is invoked in the initialization population stage to improve the population diversity; secondly, the positive cosine algorithm incorporating random inertia weights is introduced in the discoverer position update, so as to improve the probability of the algorithm jumping out of the local optimum and speed up the convergence; finally, the firefly perturbation is used to firefly perturb the sparrows, and all sparrows are updated with the optimal sparrows using the firefly perturbation method to improve their search-ability. Thirteen benchmark test functions were chosen to evaluate SFSSA, and the results were compared to those computed by existing swarm intelligence algorithms, as well as the proposed method was submitted to the Wilcoxon rank sum test. Furthermore, the aforesaid methods were evaluated in the CEC 2017 test functions to further validate the optimization efficiency of the algorithm when the optimal solution is not zero. The findings show that SFSSA is more favorable in terms of algorithm performance, and the method's searchability is boosted. Finally, the suggested algorithm is used to the locating problem of emergency material distribution centers to further validate the feasibility and efficacy of SFSSA.
群体智能算法是一种相对简单且高度适用的算法,特别适用于解决具有高可重复性、高随机性、大规模、多目标和多约束特征的优化问题。麻雀搜索算法(SSA)是一种具有较强搜索能力的群体智能算法,但 SSA 在迭代过程中容易陷入局部最优。因此,提出了一种正弦余弦和萤火虫扰动麻雀搜索算法(SFSSA)来解决这个问题。首先,在初始化种群阶段调用帐篷混沌映射来提高种群多样性;其次,在发现者位置更新中引入包含随机惯性权重的正余弦算法,以提高算法跳出局部最优的概率并加速收敛;最后,使用萤火虫扰动来扰动麻雀,并用萤火虫扰动方法更新所有麻雀,使用最优麻雀更新来提高它们的搜索能力。选择了十三个基准测试函数来评估 SFSSA,并将结果与现有的群体智能算法以及提出的方法进行比较,并进行了 Wilcoxon 秩和检验。此外,还在 CEC 2017 测试函数中评估了上述方法,以进一步验证算法在最优解不为零时的优化效率。结果表明,SFSSA 在算法性能方面更具优势,并且提高了方法的搜索能力。最后,将所提出的算法应用于应急物资配送中心的定位问题,进一步验证了 SFSSA 的可行性和有效性。