Abstract—In order to solve discrete optimization problems, this paper proposed a discrete bacterial foraging algorithm (DBFA) based on the idea of bacterial foraging optimization (BFO). The proposed DBFA applies binary encoding, and thus has the advantages of solving both discrete and continuous optimization problems. Also, according to sharing experiences of bacterium, we use the rotation step to update velocities of bacteria and obtain its corresponding positions. Then we evaluate the efficiency of the proposed algorithm through three classical benchmark functions and spectrum allocation problem of cognitive radio. Simulation results show that the proposed algorithm is superior to some previous intelligence algorithms in both convergence rate and convergence accuracy.

Index Terms—Discrete bacterial foraging algorithm, bacterial foraging optimization, benchmark functions, spectrum allocation, cognitive radio

Cite: Chuanwen Luo, Xiaowei Yin, and Chundi Ni, "A Novel Discrete Bacterial Foraging Algorithm and Its Application," Journal of Communications, vol. 10, no. 4, pp. 238-244, 2015. Doi: 10.12720/jcm.10.4.238-244