一种基于Lévy飞行轨迹的蝙蝠算法*

摘要

针对新型元启发式蝙蝠算法存在收敛速度慢、求解精度低的现象，文中提出一种基于Lévy飞行轨迹的蝙蝠算法。该算法具有易跳出局部最优，收敛速度快且求解精度高等特点。通过对12个典型的测试函数进行仿真实验，结果表明该算法是有效、可行的，且在求解高维空间问题中也表现出优越的逼近性能。%Aiming at the phenomenon that bat algorithm has slow convergence and low precision, an improved bat algorithm based on Lévy flights trajectory is proposed. The proposed algorithm is characterized by quick convergence and high precision, and it can effectively jump out of local optimum. By means of 12 typical test functions simulation, the results show that the algorithm is effective and feasible. Moreover, the algorithm also has excellent approximation performance in solving an optimization problem with high-dimensional space.