A new chaotic binary gravitational search algorithm and its algorithm test

A new chaotic binary gravitational search algorithm (CBGSA) is proposed to accelerate the convergence speed and improve the searching precision of binary gravitational search algorithm. Firstly, the randomness, ergodicity and regularity of chaotic sequence are used to search the kbest set in order to enhance the global searching ability. Then the dynamic adjustment strategy of gravitational constant is introduced to increase the diversity of particles and improve the convergence speed and accuracy of the algorithm. Finally, by comparing the simulation test results of each algorithm in six typical functions, it is shown that CBGSA can effectively overcome the shortcomings of premature convergence, and has obvious advantages in convergence accuracy, convergence speed and stability.