Affiliations: School of Science, Nanjing University of Science and Technology, Nanjing, Jiangsu, China
Correspondence:
[*]
Corresponding author. Yuanguo Zhu, School of Science, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China. E-mail: tcinina@163.com; ygzhu@njust.edu.cn.
Abstract: Bacteria foraging optimization (BFO) algorithm is easy to fall into the local optimal solution and slow in convergence. In this paper, we have come up with a self-adaptive bacterial foraging algorithm based on estimation of distribution to overcome the mentioned shortages. First, in the chemotactic operator, the swimming step size of bacterium is adaptively adjusted by its fitness value and bacteria move in a random direction. Second, the bacteria obtain the probability of replication based on the fitness value. We choose half of the population for replication by the roulette wheel method. Finally, the possibility of elimination-dispersal is adjusted by the fitness value. Selected bacteria are dispersed to the new locations produced by BOX-Muller formula. Compared with some relative heuristic algorithms on finding the optimal value of ten benchmark functions, the proposed algorithm shows higher convergence speed and accuracy.
Keywords: Bacteria foraging optimization algorithm, self-adaptive, estimation of
distribution, benchmark function
