Gravitational Swarm Optimizer for Global Optimization

In this article, a new meta-heuristic method is proposed by combining particle swarm optimization (PSO) and gravitational search in a coherent way. The advantage of swarm intelligence and the idea of a force of attraction between two particles are employed collectively to propose an improved meta-heuristic method for constrained optimization problems. Excellent constraint handling is always required for the success of any constrained optimizer. In view of this, an improved constraint-handling method is proposed which was designed in alignment with the constitutional mechanism of the proposed algorithm. The design of the algorithm is analyzed in many ways and the theoretical convergence of the algorithm is also established in the article. The e�fficiency of the proposed technique was assessed by solving a set of 24 constrained problems and 15 unconstrained problems which have been proposed in IEEE-CEC sessions 2006 and 2015, respectively. The results are compared with 11 state-of-the-art algorithms for constrained problems and 6 state-of-the-art algorithms for unconstrained problems. A variety of ways are considered to examine the ability of the proposed algorithm in terms of its converging ability, success, and statistical behavior. The performance of the proposed constraint-handling method is judged by analyzing its ability to produce a feasible population. It was concluded that the proposed algorithm performs e�fficiently with good results as a constrained optimizer