Performance of bacterial foraging optimization in dynamic environments

Authors:
Jade Abbott;Andries P. Engelbrecht
Affiliations:
CIRG, Department of Computer Science, University of Pretoria, South Africa;CIRG, Department of Computer Science, University of Pretoria, South Africa
Venue:
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Year:
2012

Citing 3
Cited 0

Particle swarm optimisation with spatial particle extension

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Swarms in dynamic environments

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Multiswarms, exclusion, and anti-convergence in dynamic environments

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bacterial foraging optimization (BFO) algorithm is a new complex, swarm-based optimization algorithm. The algorithm has shown to be successful in static environments; however there is little research available on analysis of its performance in dynamic environments. The aim of this article is to conduct an elaborate empirical analysis of BFO in a number of dynamic environments. Additionally, a modification to BFO is proposed to improve BFO's performance in dynamic environments.