On the Convergence Analysis of Gravitational Search Algorithm

Gravitational search algorithm (GSA) is one of the newest swarm basedoptimization algorithms, which has been inspired by the Newtonian laws of gravityand motion. GSA has empirically shown to be an efficient and robust stochasticsearch algorithm. Since introducing GSA a convergence analysis of this algorithmhas not yet been developed. This paper introduces the first attempt to a formalconvergence analysis of the standard gravitational search algorithm which involveswith randomness and time varying parameters. In this analysis the behavior of GSAon the facet of mass interaction is considered. The paper provides a formal proofthat each object converges to a stable point.

کلیدواژه ها:

Analysis of algorithms ، Heuristic optimization ، Swarm intelligence ، Gravitational Search Algorithm ، Convergence