差分细菌觅食算法  

BACTERIA FORAGING OPTIMISATION ALGORITHM BASED ON DIFFERENTIAL EVOLUTION

作　　者：王钰婷[1] 李珺[1] 廖周宇[2] 

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070 [2]河池学院计算机与信息工程学院,广西宜州546300

出　　处：《计算机应用与软件》2015年第12期239-244,248,共7页Computer Applications and Software

基　　金：国家自然科学基金项目(61163010)

摘　　要：为解决细菌觅食优化算法BFO(bacteria foraging optimization)迭代过程中因种群多样性损失较快而易陷入局优的问题,将差分进化思想和BFO结合。首先在BFO的趋向性操作和繁殖操作中使用差分策略更新细菌位置,从而保证群体内的多样性不会随着算法迭代的进行而过快降低。其次是对算法中细菌位置更新方式的改进,通过逐维更新每一个维度信息而非一次更新一个细菌所有维度信息的方式,充分利用每一次位置改变带来的有利信息,从而大幅提高了算法寻找到全局最优值的效率。与其他4个算法对10个标准优化函数的测试结果对比表明,改进后的算法在寻得最优值的精度、效率、稳定性方面表现更好。Bacterial foraging optimisation（ BFO） algorithm is easy to fall into local optima in iteration process due to rapid loss in population diversity. To solve this problem,we combine the differential evolution idea with BFO. First,in operation of chemotaxis and reproduction of BFO,we employ differential policy to update bacteria locations so as to ensure that the diversity within the population will not degrade too fast along with algorithm iteration process. Secondly,we improve the way of bacteria locations update in the algorithm,by updating the dimensionality information per dimension one by one rather than updating all the dimensionalities information of a bacterium once,we make full use of the favourable information brought by every location change,therefore greatly improve the efficiency of the algorithm in searching global optimum value. It is demonstrated by contrasting the testing results of the proposed algorithm with other four algorithms on ten benchmark optimisation functions that the improved algorithm performs better in terms of accuracy,efficiency and stability of the searched optimum value.

关 键 词：差分进化 细菌觅食算法 多样性 高维度 位置的更新方式 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]