Abstract
Bacterial foraging optimization (BFO) is a swarm intelligence algorithm inspired from forging behavior of the E. coli bacteria. The BFO is based on three basic processes; chemotaxis, reproduction, and elimination-dispersal. In the elimination-dispersal process, a constant probability of elimination is assigned to all bacteria. The assignment is independent of bacteria’s ranking in the population. Therefore, a bacterium which can be near to an optimal position may be replaced with one which is far away from the optimum solution, thus, affecting the convergence speed. In this paper an improved BFO algorithm (IBFOA) is proposed. The improvement lies in the elimination and dispersal event in which a non-uniform probability distribution is used. The non-uniform distribution is implemented by a linear and nonlinear probability distribution that replaces the conventional constant distribution. Simulation results show the efficiency of the proposed algorithm compared to the conventional bacterial foraging algorithm in terms of convergence speed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
