Adaptive Computational Chemotaxis in Bacterial Foraging Algorithm
CISIS '08 Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems
Transmission loss reduction based on FACTS and bacteria foraging algorithm
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
IEEE Transactions on Evolutionary Computation
A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation
IEEE Transactions on Evolutionary Computation
A novel chemistry based metaheuristic optimization method for mining of classification rules
Expert Systems with Applications: An International Journal
| Hi-index | 12.05 |
The bacterial foraging optimization (BFO) algorithm is a popular stochastic, population-based optimization technique that can be applied to a wide range of problems. Two are the major issues the BFO algorithm is confronted with: first, the foraging mechanism of BFO might in some cases induce the attraction of bacteria gathered near the global optimum by bacteria gathered to local optima, thus slowing down the whole population convergence. Second, BFO is susceptible to the curse-of-dimensionality, which makes it significantly harder to find the global optimum of a high-dimensional problem, compared to a low-dimensional problem with similar topology. In this paper, we introduce a novel BFO-based optimization algorithm aiming to address these issues, the synergetic bacterial swarming optimization (SBSO) algorithm. Our novel approach consists of: (i) the introduction of the swarming dynamics of the particle swarm optimization algorithm in the context of BFO, in order to ameliorate the convergence issues of the BFO bacteria foraging mechanism; and (ii) the utilization of multiple populations to optimize different components of the solution vector cooperatively, so as to mitigate the curse-of-dimensionality issues of the algorithm. We demonstrate the efficacy of our approach on several benchmark optimization problems.