Adaptive Computational Chemotaxis in Bacterial Foraging Algorithm

Some researchers have illustrated how individual and groups of bacteria forage for nutrients and to model it as a distributed optimization process, which is called the Bacterial Foraging Optimization (BFOA). One of the major driving forces of BFOA is the chemotactic movement of a virtual bacterium, which models a trial solution of the optimization problem. In this article, we analyze the chemotactic step of a one dimensional BFOA in the light of the classical Gradient Descent Algorithm (GDA). Our analysis points out that chemotaxis employed in BFOA may result in sustained oscillation, especially for a flat fitness landscape, when a bacterium cell is very near to the optima. To accelerate the convergence speed near optima we have made the chemotactic step size C adaptive. Computer simulations over several numerical benchmarks indicate that BFOA with the new chemotactic operation shows better convergence behavior as compared to the classical BFOA.

• Type: Conference
• Year: 2008
• Where: CISIS
• Authors: Sambarta Dasgupta, Arijit Biswas, Ajith Abraham, Swagatam Das
• Keywords: Chemotactic, Chemotactic Movement, Chemotactic Step, CISIS 2008, Software Engineering