Department of Computer Science, Lahore Garrison University, Lahore 54000, Pakistan.
Department of Statistics and Computer Science, University of Veterinary and Animal Sciences, Lahore 54000, Pakistan.
Biomed Res Int. 2022 May 30;2022:2636515. doi: 10.1155/2022/2636515. eCollection 2022.
One of the most well-known methods for solving real-world and complex optimization problems is the gravitational search algorithm (GSA). The gravitational search technique suffers from a sluggish convergence rate and weak local search capabilities while solving complicated optimization problems. A unique hybrid population-based strategy is designed to tackle the problem by combining dynamic multiswarm particle swarm optimization with gravitational search algorithm (GSADMSPSO). In this manuscript, GSADMSPSO is used as novel training techniques for Feedforward Neural Networks (FNNs) in order to test the algorithm's efficiency in decreasing the issues of local minima trapping and existing evolutionary learning methods' poor convergence rate. A novel method GSADMSPSO distributes the primary population of masses into smaller subswarms, according to the proposed algorithm, and also stabilizes them by offering a new neighborhood plan. At this time, each agent (particle) increases its position and velocity by using the suggested algorithm's global search capability. The fundamental concept is to combine GSA's ability with DMSPSO's to improve the performance of a given algorithm's exploration and exploitation. The suggested algorithm's performance on a range of well-known benchmark test functions, GSA, and its variations is compared. The results of the experiments suggest that the proposed method outperforms the other variants in terms of convergence speed and avoiding local minima; FNNs are being trained.
求解实际复杂优化问题的一种著名方法是引力搜索算法(GSA)。在解决复杂优化问题时,引力搜索技术的收敛速度较慢,局部搜索能力较弱。本文设计了一种独特的混合基于种群的策略,通过将动态多群粒子群优化与引力搜索算法(GSADMSPSO)相结合来解决这个问题。在本文中,GSADMSPSO 被用作前馈神经网络(FNN)的新型训练技术,以测试该算法在减少局部极小值捕获问题和现有进化学习方法的较差收敛率方面的效率。根据所提出的算法,GSADMSPSO 将主质量种群分配到较小的子群中,并通过提供新的邻域计划来稳定它们。此时,每个代理(粒子)通过使用建议算法的全局搜索能力来增加其位置和速度。基本思想是结合 GSA 的能力和 DMSPSO 的能力来提高给定算法的探索和开发性能。将所提出的算法与各种知名基准测试函数、GSA 及其变体进行了比较。实验结果表明,在所提出的方法在收敛速度和避免局部最小值方面优于其他变体;正在训练 FNN。