A review of the bacterial foraging algorithm in constrained numerical optimization

A review of the bacterial foraging optimization algorithm used to solve numerical constrained optimization problems is presented in this paper. After an introduction to the algorithm and its main elements, a taxonomy of constraint-handling techniques is presented and adopted to discuss the different approaches based on the algorithm. Aspects related to the most important elements of the algorithm with respect to a constrained search space (e.g., constraint-handling technique, stepsize, tumble-swim operator, reproduction process) are analyzed. Based on the findings of this literature review, some fertile paths of research are presented.