The improvement of glowworm swarm optimization for continuous optimization problems

Authors:
Bin Wu;Cunhua Qian;Weihong Ni;Shuhai Fan
Affiliations:
Department of Industrial Engineering, Nanjing University of Technology, Nanjing 210009, PR China;Department of Industrial Engineering, Nanjing University of Technology, Nanjing 210009, PR China;Department of Industrial Engineering, Nanjing University of Technology, Nanjing 210009, PR China;Department of Industrial Engineering, Nanjing University of Technology, Nanjing 210009, PR China
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 2
Cited 3

Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations

Robotics and Autonomous Systems
Rendezvous of glowworm-inspired robot swarms at multiple source locations: a sound source based real-robot implementation

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence

A novel chemistry based metaheuristic optimization method for mining of classification rules

Expert Systems with Applications: An International Journal
Hybrid harmony search and artificial bee colony algorithm for global optimization problems

Computers & Mathematics with Applications
Artificial bee colony algorithm: a survey

International Journal of Advanced Intelligence Paradigms

Quantified Score

Hi-index	12.05

Visualization

Abstract

Glowworm swarm optimization (GSO) algorithm is the one of the newest nature inspired heuristics for optimization problems. In order to enhances accuracy and convergence rate of the GSO, two strategies about the movement phase of GSO are proposed. One is the greedy acceptance criteria for the glowworms update their position one-dimension by one-dimension. The other is the new movement formulas which are inspired by artificial bee colony algorithm (ABC) and particle swarm optimization (PSO). To compare and analyze the performance of our proposed improvement GSO, a number of experiments are carried out on a set of well-known benchmark global optimization problems. The effects of the parameters about the improvement algorithms are discussed by uniform design experiment. Numerical results reveal that the proposed algorithms can find better solutions when compared to classical GSO and other heuristic algorithms and are powerful search algorithms for various global optimization problems.