Improved Gravitational Search Algorithm Based on Adaptive Strategies

The gravitational search algorithm is a global optimization algorithm that has the advantages of a swarm intelligence algorithm. Compared with traditional algorithms, the performance in terms of global search and convergence is relatively good, but the solution is not always accurate, and the algorithm has difficulty jumping out of locally optimal solutions. In view of these shortcomings, an improved gravitational search algorithm based on an adaptive strategy is proposed. The algorithm uses the adaptive strategy to improve the updating methods for the distance between particles, gravitational constant, and position in the gravitational search model. This strengthens the information interaction between particles in the group and improves the exploration and exploitation capacity of the algorithm. In this paper, 13 classical single-peak and multi-peak test functions were selected for simulation performance tests, and the CEC2017 benchmark function was used for a comparison test. The test results show that the improved gravitational search algorithm can address the tendency of the original algorithm to fall into local extrema and significantly improve both the solution accuracy and the ability to find the globally optimal solution.