A novel co-swarm gravitational search algorithm for constrained optimization

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article a new co-swarm Gravitational Search Algorithm is proposed to solve the non-linear constrained optimization problems. The idea of Gravitational search algorithm (GSA) and Differential Evolution (DE) is inherited to proposed a new robust search algorithm. The individual influences of GSA and DE over the particles is incorporated collectively to provide a more effective influence in comparison to the individual influences of the GSA and DE. A new velocity update equation is propose to update the positions of the particles. To evaluate the availability of the proposed algorithm a state-of-the-art problems proposed in IEEE CEC 2006 is solved and the results are compared with GSA and DE. The supremacy of the proposed algorithm is benchmarked over the exhaustive simulation results, feasibility rate and success rate.

Cite

CITATION STYLE

APA

Yadav, A., & Deep, K. (2014). A novel co-swarm gravitational search algorithm for constrained optimization. In Advances in Intelligent Systems and Computing (Vol. 258, pp. 629–640). Springer Verlag. https://doi.org/10.1007/978-81-322-1771-8_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free