A Computationally Efficient Gravitational Search Algorithm

Gravitational search algorithm (GSA) is a population-based optimisation technique that was originally developed to deal with high-dimensional search spaces. In recent years, GSA has been successfully applied to a wide range of problems. At every iteration, the algorithm calculates the gravitational force of each solution with respect to all other solutions, which has combinatorial complexity. In this paper, we propose an efficient way for calculating the force component of each solution, reducing the complexity of GSA from O(N-2) to O(N log (N)), where N is the population size. The experimental evaluation shows that the new algorithm is computationally efficient and cost effective.