##
**Adaptive bacterial foraging optimization.**
*(English)*
Zbl 1220.90167

Summary: Bacterial foraging optimization (BFO) is a recently developed nature-inspired optimization algorithm, which is based on the foraging behavior of E. coli bacteria. Up to now, BFO has been applied successfully to some engineering problems due to its simplicity and ease of implementation. However, BFO possesses a poor convergence behavior over complex optimization problems as compared to other nature-inspired optimization techniques. This paper first analyzes how the run-length unit parameter of BFO controls the exploration of the whole search space and the exploitation of the promising areas. Then it presents a variation on the original BFO, called the adaptive bacterial foraging optimization (ABFO), employing the adaptive foraging strategies to improve the performance of the original BFO. This improvement is achieved by enabling the bacterial foraging algorithm to adjust the run-length unit parameter dynamically during algorithm execution in order to balance the exploration/exploitation tradeoff. The experiments compare the performance of two versions of ABFO with the original BFO, the standard particle swarm optimization (PSO) and a real-coded genetic algorithm (GA) on four widely-used benchmark functions. The proposed ABFO shows a marked improvement in performance over the original BFO and appears to be comparable with the PSO and GA.

### MSC:

90C59 | Approximation methods and heuristics in mathematical programming |

92D25 | Population dynamics (general) |

PDF
BibTeX
XML
Cite

\textit{H. Chen} et al., Abstr. Appl. Anal. 2011, Article ID 108269, 27 p. (2011; Zbl 1220.90167)

### References:

[1] | C. A. Floudas, Deterministic Global Optimization: Theory, Methods and Applications, vol. 37 of Nonconvex Optimization and Its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000. · Zbl 0986.92013 |

[2] | J. C. Spall, Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, Hoboken, NJ, USA, 2003. · Zbl 1088.90002 |

[3] | J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to B, control, and Artificial Intelligence, University of Michigan Press, Ann Arbor, Mich, USA, 1975. · Zbl 0429.03045 |

[4] | M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics. Part B, vol. 26, no. 1, pp. 29-41, 1996. |

[5] | M. Dorigo, G. Di Caro, and L. M. Gambardella, “Ant algorithms for discrete optimization,” Artificial Life, vol. 5, no. 2, pp. 137-172, 1999. |

[6] | R. C. Eberchart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceeding of the 6th International Symposium on Micromachine and Human Science, pp. 39-43, Nagoya, Japan, 1995. |

[7] | H. Chen, Y. Zhu, K. Hu, and X. He, “Hierarchical swarm model: a new approach to optimization,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 379649, 30 pages, 2010. · Zbl 1191.90096 |

[8] | H. J. Bremermann and R. W. Anderson, “An alternative to back-propagation: a simple rule of synaptic modification for neural net training and memory,” Tech. Rep. PAM-483, Center for Pure and Applied Mathematics, University of California, 1990. |

[9] | S. D. Müller, J. Marchetto, S. Airaghi, and P. Koumoutsakos, “Optimization based on bacterial chemotaxis,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 16-29, 2002. · Zbl 05452016 |

[10] | K. M. Passino, “Biomimicry of bacterial foraging for distributed optimization and control,” IEEE Control Systems Magazine, vol. 22, no. 3, pp. 52-67, 2002. |

[11] | D. H. Kim and J. H. Cho, “Adaptive tuning of PID controller for multivariable system using bacterial foraging based optimization,” in Proceedings of the 3rd International Atlantic Web Intelligence Conference on Advances in Web Intelligence (AWIC ’05), vol. 3528 of Lecture Notes in Computer Science, pp. 231-235, June 2005. |

[12] | S. Mishra, “A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, pp. 61-73, 2005. · Zbl 05452014 |

[13] | M. Tripathy, S. Mishra, L. L. Lai, and Q. P. Zhang, “Transmission loss reduction based on FACTS and bacteria foraging algorithm,” in Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN ’06), vol. 4193 of Lecture Notes in Computer Science, pp. 222-231, September 2006. |

[14] | D. H. Kim and C. H. Cho, “Bacterial foraging based neural network fuzzy learning,” in Proceedings of the Indian International Conference on Artificial Intelligence (IICAI ’05), pp. 2030-2036, 2005. |

[15] | D. H. Kim, A. Abraham, and J. H. Cho, “A hybrid genetic algorithm and bacterial foraging approach for global optimization,” Information Sciences, vol. 177, no. 18, pp. 3918-3937, 2007. · Zbl 05174420 |

[16] | A. Biswas, S. Dasgupta, S. Das, and A. Abraham, “Synergy of PSO and bacterial foraging optimization-a comparative study on numerical benchmarks,” in Proceedings of the 2nd International Sympium on Hybrid Artificial Intelligence Systems (HAIS): Advances Soft Computing, vol. 44, pp. 255-263, 2007. |

[17] | H. Chen, Y. Zhu, and K. Hu, “Multi-colony bacteria foraging optimization with cell-to-cell communication for RFID network planning,” Applied Soft Computing Journal, vol. 10, no. 2, pp. 539-547, 2010. · Zbl 05739805 |

[18] | H. Chen, Y. Zhu, and K. Hu, “Cooperative bacterial foraging optimization,” Discrete Dynamics in Nature and Society, vol. 2009, Article ID 815247, 17 pages, 2009. · Zbl 1175.90425 |

[19] | J. Adler, “Chemotaxis in bacteria,” Science, vol. 153, no. 3737, pp. 708-716, 1966. |

[20] | J. Krause and G. D. Ruxton, Living in Groups, Oxford Series in Ecology and Evolution, Oxford University Press, Oxford, UK, 2002. |

[21] | D. C. Krakauer and M. A. Rodríguez-Gironés, “Searching and learning in a random environment,” Journal of Theoretical Biology, vol. 177, no. 4, pp. 417-429, 1995. |

[22] | J. N. M. Smith, “The food searching behaviour of two European thrushes. II. The adaptiveness of the search patterns,” Behavior, vol. 49, no. 1-2, pp. 1-61, 1974. |

[23] | L. A. Giraldeau and G. Beauchamp, “Food exploitation: searching for the optimal joining policy,” Trends in Ecology and Evolution, vol. 14, no. 3, pp. 102-106, 1999. |

[24] | R. P. Gendron and J. E. R. Staddon, “Searching for cryptic prey: the effect of search rate,” American Naturalist, vol. 121, no. 2, pp. 172-186, 1983. |

[25] | R. Hinterding, Z. Michalewicz, and A. E. Eiben, “Adaptation in evolutionary computation: A survey,” in Proceedings of the IEEE Conference on Evolutionary Computation (ICEC,97 ), pp. 65-69, Indianapolis, IN, USA, April 1997. |

[26] | T. Bäck, “Introduction to the Special Issue: self-adaptation,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 2, pp. 3-4, 2001. |

[27] | Y. Shi and R. C. Eberhart, “Fuzzy adaptive particle swarm optimization,” in Proceedings of the IEEE Conference on Evolutionary Computation (ICEC ’01), vol. 1, pp. 101-106, May 2001. |

[28] | H. Chen and Y. Zhu, “Optimization based on symbiotic multi-species coevolution,” Applied Mathematics and Computation, vol. 205, no. 1, pp. 47-60, 2008. · Zbl 1152.92014 |

[29] | H. Chen, Y. Zhu, and K. Hu, “Discrete and continuous optimization based on multi-swarm coevolution,” Natural Computing, vol. 9, no. 3, pp. 659-682, 2010. · Zbl 1208.90197 |

[30] | S. Sumathi, T. Hamsapriya, and P. Surekha, Evolutionary Intelligence: An Introduction to Theory and Applications with Matlab, Springer, Berlin, Germany, 2008. |

[31] | X. Yao and Y. Liu, “Scaling up evolutionary programming algorithms,” in Proceedings of the 7th Annual Conference on Evolutionary Programming (EP ’98), pp. 103-112, 1998. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.