Enhance chaotic gravitational search algorithm (CGSA) by balance adjustment mechanism and sine randomness function for continuous optimization problems

The gravitational search algorithm (GSA) is a population-based meta-heuristic optimization algorithm which finds the optimal solution by the law of gravity and attraction between objects. However, as the number of iterations increases, the increase of the quality of the agents makes GSA fall into the local optimal solution more easily, which greatly reduces the exploration capability of the algorithm. Although the chaotic gravitational search algorithm (CGSA) uses chaotic maps for improving diversity to solve this problem, it still has problems with the balance of exploration and exploitation. This paper proposes the balance adjustment based chaotic gravitational search algorithm (BA-CGSA), which introduces the sine randomness function and the balance mechanism to solve the above problem. 30 benchmark functions of IEEE CEC 2014 are adopted to evaluate the performance of the proposed algorithm in terms of exploration and exploitation. Meanwhile, a real engineering design problem is used to illustrate the ability of the algorithm to solve practical application problems. The experimental results demonstrate its good performance in continuous optimization problems. (C) 2019 Elsevier B.V. All rights reserved.