当前位置: X-MOL 学术Nat. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Improving convergence in swarm algorithms by controlling range of random movement
Natural Computing ( IF 1.7 ) Pub Date : 2021-01-05 , DOI: 10.1007/s11047-020-09826-y
Reshu Chaudhary , Hema Banati

Swarm intelligence algorithms are stochastic algorithms, i.e. they perform some random movement. This random movement imparts the algorithms with exploration capabilities and allows them to escape local optima. Exploration at the start of execution helps with thorough inspection of the search/solution space. However, as the algorithm progresses, the focus should ideally shift from exploration to exploitation. This shift would help the algorithm to enhance existing solutions and improve its convergence capabilities. Hence if the range of random movement is not kept in check, it may limit an algorithm’s convergence capabilities and overall efficiency. To ensure that the convergence of an algorithm is not compromised, an improved search technique to reduce range of uniform random movement was recently proposed for bat algorithm. Uniform distribution and levy distribution are the most commonly used random distributions in swarm algorithms. In this paper, the applicability of the improved search technique over different swarm algorithms employing uniform and levy distributions, as well as Cauchy distribution has been studied. The selected algorithms are firefly algorithm, cuckoo search algorithm, moth search algorithm, whale optimization algorithm, earthworm optimization algorithm and elephant herding optimization algorithm. The resultant variants of each of these algorithms show improvement upon inclusion of the improved search technique. Hence results establish that the improved search technique has positive influence over swarm algorithms employing different random distributions.



中文翻译:

通过控制随机运动的范围来改善群算法的收敛性

群智能算法是随机算法,即它们执行一些随机运动。这种随机运动为算法赋予了探索能力,并使它们能够逃脱局部最优。执行开始时的探索有助于彻底检查搜索/解决方案空间。但是,随着算法的发展,理想的重点应该从勘探转向开发。这种转变将有助于算法增强现有解决方案并提高其收敛能力。因此,如果不控制随机运动的范围,则可能会限制算法的收敛能力和整体效率。为了确保算法的收敛性不受影响,最近针对蝙蝠算法提出了一种减小均匀随机运动范围的改进搜索技术。均匀分布和征税分布是群体算法中最常用的随机分布。在本文中,研究了改进的搜索技术在采用统一和征费分布以及柯西分布的不同群体算法中的适用性。选择的算法是萤火虫算法,杜鹃搜索算法,蛾搜索算法,鲸鱼优化算法,earth优化算法和象群优化算法。这些算法中每种算法的最终变体在包含改进的搜索技术后均显示出改进。因此结果表明,改进的搜索技术对采用不同随机分布的群体算法具有积极影响。在本文中,研究了改进的搜索技术在采用统一和征费分布以及柯西分布的不同群体算法中的适用性。选择的算法是萤火虫算法,杜鹃搜索算法,蛾搜索算法,鲸鱼优化算法,earth优化算法和象群优化算法。这些算法中每种算法的最终变体在包含改进的搜索技术后均显示出改进。因此结果表明,改进的搜索技术对采用不同随机分布的群体算法具有积极影响。在本文中,研究了改进的搜索技术在采用统一和征费分布以及柯西分布的不同群体算法中的适用性。选择的算法是萤火虫算法,杜鹃搜索算法,蛾搜索算法,鲸鱼优化算法,earth优化算法和象群优化算法。这些算法中每种算法的最终变体在包含改进的搜索技术后均显示出改进。因此结果表明,改进的搜索技术对采用不同随机分布的群体算法具有积极影响。选择的算法是萤火虫算法,杜鹃搜索算法,蛾搜索算法,鲸鱼优化算法,earth优化算法和象群优化算法。这些算法中每种算法的最终变体在包含改进的搜索技术后均显示出改进。因此结果表明,改进的搜索技术对采用不同随机分布的群体算法具有积极影响。选择的算法是萤火虫算法,杜鹃搜索算法,蛾搜索算法,鲸鱼优化算法,earth优化算法和象群优化算法。这些算法中每种算法的最终变体在包含改进的搜索技术后均显示出改进。因此结果表明,改进的搜索技术对采用不同随机分布的群体算法具有积极影响。

更新日期:2021-01-05
down
wechat
bug