蝙蝠算法的全局收敛性分析

Analysis of bat algorithm′s global convergence

为了研究蝙蝠算法的收敛性,本文基于随机搜索算法的全局收敛性判断准则对蝙蝠算法的收敛性进行了分析,并通过仿真实验进行了验证.结果表明,蝙蝠算法不完全满足随机搜索优化算法的2个全局收敛准则,无法确保全局收敛,因此蝙蝠算法属于局部搜索优化算法.

In order tO study the convergence of the bat algorithm, based on the global convergence criteria of random optimal algorithm, the convergence of the bat algorithm is analyzed to prove that the bat algo- rithm does not fully meet the two global optimization algorithm convergence criteria. And through the simulation experiments, the result shows that the bat algorithm cannot ensure global convergence, so it belongs to the local search optimization algorithm.