This paper proposes a variant of the bacterial foraging optimization (BFO) algorithm with time-varying chemotaxis step length and comprehensive learning strategy, namely Adaptive Comprehensive Learning Bacterial Foraging Optimization (ALCBFO). An adaptive non-linearly decreasing modulation model is used to balance the exploration and exploitation. The comprehensive learning mechanism is adopted to maintain the diversity of the bacterial population and thus alleviates the premature convergence. Compared with the classical GA, PSO, the original BFO and two improved BFOs (BFO-LDC and BFO-NDC), the proposed ACLBFO shows significantly better performance in solving multimodal problems. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Tan, L., Wang, H., Liang, X., & Xing, K. (2013). An adaptive comprehensive learning bacterial foraging optimization for function optimization. In Communications in Computer and Information Science (Vol. 375, pp. 194–199). Springer Verlag. https://doi.org/10.1007/978-3-642-39678-6_33
Mendeley helps you to discover research relevant for your work.