Xinxin Zhou, Guangwei Zhu, Journal of Information Processing Systems Vol. 18, No. 3, pp. 332-343, Jun. 2022  

10.3745/JIPS.01.0088
Keywords: Asynchronous Learning, Gravitational Search Algorithm, Levy Flight, Sinusoidal Map
Fulltext: PDF Full Text PubReader

Abstract

To address the problems of the gravitational search algorithm (GSA) in which the population is prone to converge prematurely and fall into the local solution when solving the single-objective optimization problem, a sine map jumping gravity search algorithm based on asynchronous learning is proposed. First, a learning mechanism is introduced into the GSA. The agents keep learning from the excellent agents of the population while they are evolving, thus maintaining the memory and sharing of evolution information, addressing the algorithm’s shortcoming in evolution that particle information depends on the current position information only, improving the diversity of the population, and avoiding premature convergence. Second, the sine function is used to map the change of the particle velocity into the position probability to improve the convergence accuracy. Third, the Levy flight strategy is introduced to prevent particles from falling into the local optimization. Finally, the proposed algorithm and other intelligent algorithms are simulated on 18 benchmark functions. The simulation results show that the proposed algorithm achieved improved the better performance.

Statistics
Cite this article