当前位置: X-MOL 学术Appl. Mathmat. Model. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Stability of salp swarm algorithm with random replacement and double adaptive weighting
Applied Mathematical Modelling ( IF 4.4 ) Pub Date : 2021-02-25 , DOI: 10.1016/j.apm.2021.02.002
Hao Ren , Jun Li , Huiling Chen , ChenYang Li

The salp swarm algorithm is a newly population-based search algorithm. Because the original salp swarm algorithm has low search efficiency and is easy to fall into local optimum, in this paper, we propose an enhanced salp swarm algorithm, which combines two strategies with the original salp swarm algorithm. One is the random replacement strategy, which can replace the current position with the optimal solution position with a certain probability of speeding up the convergence rate. The other tactic is double adaptive weight, which can expand the search scope throughout the early stages and enhance exploitation capability in the later stages. With the cooperation and guidance of the two mechanisms, the algorithm's convergence speed is accelerated, and the exploitation capacity is meritoriously increased. The proposed method's performance is compared with three mainstream meta-heuristics and four advanced algorithms on four necessary test cases. The extensive analysis and recorded results indicate that the proposed method outperforms these algorithms in terms of the accuracy of the solution and convergence speed. Finally, we apply the developed method to four well-known engineering design problems (welded beam design problem; cantilever beam design; I-beam design; and multiple disk clutch brake) to validate the algorithm's effectiveness for some constrained challenge. The results show that our algorithm has significant advantages in solving practical problems with constraints and unknown search spaces.



中文翻译:

具有随机替换和双重自适应加权的Salp群算法的稳定性

salp群算法是一种新的基于人口的搜索算法。由于原始的salp swarm算法搜索效率低,容易陷入局部最优,因此本文提出了一种增强的salp swarm算法,该算法将两种策略与原始的salp swarm算法相结合。一种是随机替换策略,该策略可以以一定的概率以最佳的解决方案位置替换当前位置,从而加快收敛速度​​。另一种策略是双重自适应权重,可以在整个早期阶段扩展搜索范围,并在后期阶段增强开发能力。在两种机制的配合和指导下,加快了算法的收敛速度,大大提高了开发能力。建议的方法” 在四个必要的测试用例上,将其性能与三种主流的元启发式算法和四种高级算法进行了比较。大量的分析和记录的结果表明,该方法在求解精度和收敛速度方面均优于这些算法。最后,我们将开发的方法应用于四个著名的工程设计问题(焊接梁设计问题;悬臂梁设计;工字梁设计;多盘离合器制动器),以验证算法在某些受限挑战下的有效性。结果表明,该算法在解决带有约束和未知搜索空间的实际问题中具有显着的优势。大量的分析和记录的结果表明,该方法在求解精度和收敛速度方面均优于这些算法。最后,我们将开发的方法应用于四个著名的工程设计问题(焊接梁设计问题;悬臂梁设计;工字梁设计;多盘离合器制动器),以验证算法在某些受限挑战下的有效性。结果表明,该算法在解决带有约束和未知搜索空间的实际问题中具有显着的优势。大量的分析和记录的结果表明,该方法在求解精度和收敛速度方面均优于这些算法。最后,我们将开发的方法应用于四个著名的工程设计问题(焊接梁设计问题;悬臂梁设计;工字梁设计;多盘离合器制动器),以验证算法在某些受限挑战下的有效性。结果表明,该算法在解决带有约束和未知搜索空间的实际问题中具有显着的优势。和多盘离合器制动器)以验证该算法在某些受限挑战中的有效性。结果表明,该算法在解决带有约束和未知搜索空间的实际问题中具有显着的优势。和多盘离合器制动器)以验证该算法在某些受限挑战中的有效性。结果表明,该算法在解决带有约束和未知搜索空间的实际问题中具有显着的优势。

更新日期:2021-03-11
down
wechat
bug