Bacterial foraging optimisation algorithm, particle swarm optimisation and genetic algorithm: a comparative study
by Soheila Sadeghiram
International Journal of Bio-Inspired Computation (IJBIC), Vol. 10, No. 4, 2017

Abstract: Nature inspired meta-heuristic algorithms have been widely used in order to find efficient solutions for optimisation problems, and granted results have been achieved. Particle swarm optimisation (PSO) algorithm is one of the most utilised algorithms in recent years, which has indicated acceptable efficiency. On the other hand, bacterial foraging optimisation algorithm (BFOA) is relatively new compared to other meta-heuristic algorithms, and like PSO has shown a good ability to solve different optimisation problems. Genetic algorithms (GAs) are a well-known group of meta-heuristic algorithms which have been in use earlier than the other in various research fields. In this paper, we compare the efficiency of BFOA and PSO algorithms in an identical condition by minimising different test functions (from two to 20 dimensional). In this experiment, GA is used as a basic method in comparing the two algorithms. The methodology and results are presented. Although results verify the accurate convergency of both algorithms, the efficiency of BFOA on high-dimensional functions is dramatically better than that of PSO.

Online publication date: Fri, 10-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com