Home /Research /Glowworm Swarm Optimization (GSO) Algorithm for Optimization Problems: A State-of-the-Art Review
SWARM

Glowworm Swarm Optimization (GSO) Algorithm for Optimization Problems: A State-of-the-Art Review

Nurezayana Zainal, Azlan Mohd Zain, Nor Haizan Mohamed Radzi, Amirmudin Udin

Year
2013
Citations
33

Abstract

Glowworm Swarm Optimization (GSO) algorithm is a derivative-free, meta-heuristic algorithm and mimicking the glow behavior of glowworms which can efficiently capture all the maximum multimodal function. Nevertheless, there are several weaknesses to locate the global optimum solution for instance low calculation accuracy, simply falling into the local optimum, convergence rate of success and slow speed to converge. This paper reviews the exposition of a new method of swarm intelligence in solving optimization problems using GSO. Recently the GSO algorithm was used simultaneously to find solutions of multimodal function optimization problem in various fields in today industry such as science, engineering, network and robotic. From the paper review, we could conclude that the basic GSO algorithm, GSO with modification or improvement and GSO with hybridization are considered by previous researchers in order to solve the optimization problem. However, based on the literature review, many researchers applied basic GSO algorithm in their research rather than others.

Keywords

Mathematical optimizationConvergence (economics)Swarm intelligenceMulti-swarm optimizationSwarm behaviourComputer scienceHeuristicMetaheuristicOptimization problemFunction (biology)

Related papers

Browse all SWARM papers