Bacterial-inspired algorithms for solving constrained optimization problems

Abstract Bio-inspired optimization techniques using analogy of swarming principles and social behavior in nature have been adopted to solve a variety of problems. In this paper Bacterial Foraging Optimization (BFO) is employed to achieve high-quality solutions to the constrained optimization problems. However, the chemotaxis step was set as only a constant in the original BFO, where no mechanism could keep the balance between global search and local search. To further improve the performance of the original BFO, we also come up with two modified BFOs, i.e. BFO with linear decreasing chemotaxis step (BFO-LDC) and BFO with non-linear decreasing chemotaxis step (BFO-NDC). In order to illustrate the efficiency of the proposed method (BFO-LDC and BFO-NDC), six well-known constrained benchmark problems from the optimization literature were selected as testing functions. The experimental results demonstrated that the modified BFOs are of greater efficiency in the speed of convergence as well as fine tune the search in the multidimensional space, and they can be used as a general approach for most nonlinear optimization problems with inequity constrains.

[1]  Leandro dos Santos Coelho,et al.  Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization Problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Jeng-Shyang Pan,et al.  A Novel Optimization Approach: Bacterial-GA Foraging , 2007, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

[3]  Ajith Abraham,et al.  Analysis of the reproduction operator in an artificial bacterial foraging system , 2010, Appl. Math. Comput..

[4]  Q. Henry Wu,et al.  Bacterial Foraging Algorithm For Dynamic Environments , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[5]  Amit Konar,et al.  On Stability of the Chemotactic Dynamics in Bacterial-Foraging Optimization Algorithm , 2009, IEEE Trans. Syst. Man Cybern. Part A.

[6]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[7]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[8]  Zhen Ji,et al.  A Fast Bacterial Swarming Algorithm for high-dimensional function optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[9]  Sukumar Mishra,et al.  A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation , 2005, IEEE Transactions on Evolutionary Computation.

[10]  Gary G. Yen,et al.  A Self Adaptive Penalty Function Based Algorithm for Constrained Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[11]  Ling Wang,et al.  An effective co-evolutionary differential evolution for constrained optimization , 2007, Appl. Math. Comput..

[12]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

[13]  A. Amirjanov The development of a changing range genetic algorithm , 2006 .

[14]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[15]  Ajith Abraham,et al.  Adaptive Computational Chemotaxis in Bacterial Foraging Algorithm , 2008, 2008 International Conference on Complex, Intelligent and Software Intensive Systems.

[16]  Gary G. Yen,et al.  An Adaptive Penalty Formulation for Constrained Evolutionary Optimization , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.