Title: Novel hybridised variants of gravitational search algorithm for constraint optimisation

Authors: Amarjeet Singh; Kusum Deep

Addresses: Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee – 247667, Uttarakhand, India ' Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee – 247667, Uttarakhand, India

Abstract: In an earlier paper, the authors proposed three new hybridised variants of gravitational search algorithm and real coded genetic algorithms for unconstrained optimisation problems, by hybridising GSA with Laplace crossover and power mutation. Experiments on a number of test problems, including CEC 2014 benchmarks, showed that the hybridised variant incorporating both Laplace crossover and power mutation emerged a winner in terms of efficiency and reliability by increased exploration and exploitation. This paper extends the hybridised variants proposed in the above paper, for the constrained optimisation making use of the Deb's constraint handling mechanism. The performance of original GSA and the three proposed variants is investigated on a set of 24 constrained benchmark problems as given in CEC 2006. Based on a rigorous analysis of results, it is concluded that the variant hybridising GSA with Laplace crossover and power mutation outperforms all others.

Keywords: gravitational search algorithm; GSA; constraint optimisation; Laplace crossover; power mutation; hybridised variants; metaheuristics.

DOI: 10.1504/IJSI.2017.082385

International Journal of Swarm Intelligence, 2017 Vol.3 No.1, pp.1 - 22

Received: 04 Sep 2015
Accepted: 05 Oct 2015

Published online: 17 Feb 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article