Performance of bacterial foraging optimization in dynamic environments

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.