Two-Step gravitational search algorithm

Abstract

In this paper, we present an efficient algorithm for solving optimization problems, which is based on gravitational search algorithm (GSA). In the proposed technique, called Two-Step method, the best solution of position will be considered and calculated with another agents, and the fitness of extended agents are compared with agents in original gravitation field, which can reinforce the exploration and exploitation performance. Ten benchmark functions are used to evaluate and to compare performance of the presented algorithm with GSA based on the same function evaluations. The initialized populations are produced randomly and are identical for each round of all the algorithms in the same benchmark function. The obtained results confirm the better performance of the proposed method in solving various nonlinear functions.