Modified gravitational search algorithm

In this paper, we present an efficient algorithm for solving optimization problems, which is based on gravitational search algorithm. In the proposed algorithm, called Member-Satellite algorithm, satellites have been appointed to all the agents which called as members in proposed algorithm. Members and their satellites are used to find a near optimal solution all together. The algorithm is continued with members or satellites with the best fitness value. Three benchmark functions are used to evaluate and to compare performance of the presented algorithm with GSA. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.