GSA-LA: gravitational search algorithm based on learning automata

ABSTRACT

Regardless of the performance of gravitational search algorithm (GSA), it is nearly incapable of avoiding local optima in high-dimension problems. To improve the accuracy of GSA, it is necessary to fine tune its parameters. This study introduces a gravitational search algorithm based on learning automata (GSA-LA) for optimisation of continuous problems. Gravitational constant G(t) is a significant parameter that is used to adjust the accuracy of the search. In this work, learning capability is utilised to select G(t) based on spontaneous reactions. To measure the performance of the introduced algorithm, numerical analysis is conducted on several well-designed test functions, and the results are compared with the original GSA and other evolutionary-based algorithms. Simulation results demonstrate that the learning automata-based gravitational search algorithm is more efficient in finding optimum solutions and outperforms the existing algorithms.