Bacterial foraging optimization algorithm with particle swarm optimization strategy for global numerical optimization

摘要

In 2002, K. M. Passino proposed Bacterial Foraging Optimization Algorithm (BFOA) for distributed optimization and control. One of the major driving forces of BFOA is the chemotactic movement of a virtual bacterium that models a trial solution of the optimization problem. However, during the process of chemotaxis, the BFOA depends on random search directions which may lead to delay in reaching the global solution. Recently, a new algorithm BFOA oriented by PSO termed BF-PSO has shown superior in proportional integral derivative controller tuning application. In order to examine the global search capability of BF-PSO, we evaluate the performance of BFOA and BF-PSO on 23 numerical benchmark functions. In BF-PSO, the search directions of tumble behavior for each bacterium oriented by the individual's best location and the global best location. The experimental results show that BF-PSO performs much better than BFOA for almost all test functions. That's approved that the BFOA oriented by PSO strategy improve its global optimization capability.