School of Electrical Engineering, Beijing Jiaotong University, Beijing 100044, China.
Comput Intell Neurosci. 2020 May 27;2020:2630104. doi: 10.1155/2020/2630104. eCollection 2020.
Bacterial foraging optimization (BFO) algorithm is a novel swarm intelligence optimization algorithm that has been adopted in a wide range of applications. However, at present, the classical BFO algorithm still has two major drawbacks: one is the fixed step size that makes it difficult to balance exploration and exploitation abilities; the other is the weak connection among the bacteria that takes the risk of getting to the local optimum instead of the global optimum. To overcome these two drawbacks of the classical BFO, the BFO based on self-adaptive chemotaxis strategy (SCBFO) is proposed in this paper. In the SCBFO algorithm, the self-adaptive chemotaxis strategy is designed considering two aspects: the self-adaptive swimming based on bacterial search state features and the improvement of chemotaxis flipping based on information exchange strategy. The optimization results of the SCBFO algorithm are analyzed with the CEC 2015 benchmark test set and compared with the results of the classical and other improved BFO algorithms. Through the test and comparison, the SCBFO algorithm proves to be effective in reducing the risk of local convergence, balancing the exploration and the exploitation, and enhancing the stability of the algorithm. Hence, the major contribution in this research is the SCBFO algorithm that provides a novel and practical strategy to deal with more complex optimization tasks.
细菌觅食优化(BFO)算法是一种新颖的群体智能优化算法,已被广泛应用于各种领域。然而,目前经典的 BFO 算法仍存在两个主要缺陷:一是固定的步长大小,难以平衡探索和开发能力;二是细菌之间的连接较弱,存在陷入局部最优而不是全局最优的风险。为了克服经典 BFO 的这两个缺点,本文提出了基于自适应趋化策略的 BFO(SCBFO)算法。在 SCBFO 算法中,考虑了两个方面来设计自适应趋化策略:基于细菌搜索状态特征的自适应游动和基于信息交换策略的趋化翻转改进。通过 CEC 2015 基准测试集对 SCBFO 算法的优化结果进行了分析,并与经典 BFO 算法和其他改进的 BFO 算法的结果进行了比较。通过测试和比较,SCBFO 算法在降低局部收敛风险、平衡探索和开发、增强算法稳定性方面证明是有效的。因此,本研究的主要贡献是提出了一种新的实用策略 SCBFO 算法,用于处理更复杂的优化任务。