基于邻域引力学习的生物地理学优化算法

针对生物地理学优化算法（Biogeography-Based Optimization，BBO）易发生早熟收敛、陷入局部最优的问题，提出一种基于邻域引力学习的生物地理学优化算法（Neighbor Force Learning Biogeography-Based Optimization，NFBBO）。该算法采用邻域选择的方法确定迁出栖息地，以充分利用栖息地的邻域信息，增加算法的种群多样性。同时采用引力学习策略对栖息地进行更新，拓展搜索空间，提高算法的搜索能力，避免早熟收敛问题。为使种群能够自适应地跳出局部最优，引入一种自适应高斯变异机制。基于高维标准测试函数的对比实验表明，NFBBO算法具有更快的收敛速度和更高的收敛精度。

Neighbor force learning biogeography-based optimization

Biogeography-Based Optimization（BBO） easily suffers from the premature convergence and local optima trapping problems. In order to solve these issues, a new algorithm, named Neighbor Force Learning Biogeography-Based Optimization（NFBBO）, is proposed in this paper. NFBBO presents a neighbor selection strategy, in which an emigrating solution is selected from the neighbors of the immigrating solution based on its suitability and distance. This operation can exploit the neighborhood information of swarm and improve the population diversity. Then, a force learning strategy is integrated with the migration operator to update the immigrating solutions. This strategy can expand the solutions search space and enhance the searching ability of BBO to avoid the prematurity. Furthermore, in order to escape from the local optima, an adaptive Gaussian mutation mechanism is further introduced, which is an effective jump-out mechanism. Experimental study is conducted on 10 well-known high-dimensional benchmark functions. The experimental results indicate that NFBBO has better search performance compared with other competing algorithms in terms of the convergence rate and the quality of the final solutions.