Bacterial foraging algorithm is one of the population-based optimization algorithms that used for solving many search problems in various branches of sciences. One of the issues discussed today is parallel implementation of population-based optimization algorithms on Gr More
Bacterial foraging algorithm is one of the population-based optimization algorithms that used for solving many search problems in various branches of sciences. One of the issues discussed today is parallel implementation of population-based optimization algorithms on Graphic Processor Units. Due to the low speed of bacterial foraging algorithm in the face of complex problem and also lack the ability to solve large-scale problems by this algorithm, Implementation on the graphics processor is a suitable solution to cover the weaknesses of this algorithm. In this paper, we proposed a parallel version of bacterial foraging algorithm which designed by CUDA and has ability to run on GPUs. The performance of this algorithm is evaluated by using a number of famous optimization problems in comparison with the standard bacterial foraging optimization algorithm. The results show that Parallel Algorithm is faster and more efficient than standard bacterial foraging optimization algorithm.
Manuscript profile