基于莱维飞行的鸟群优化算法

Bird Swarm Algorithm based on Levy flight

摘要:

针对鸟群优化算法(BSA)在求解高维多极值优化问题时容易陷入局部最优解和出现早熟收敛的情况,在原始鸟群算法的基础上,在模拟鸟群飞行行为的过程中引入莱维飞行,提出了一种基于莱维飞行的改进算法——莱维-鸟群算法(LBSA)。这种算法替换了原算法中随机的飞行位置跳变,而采用莱维飞行更新鸟群飞行后的位置,大幅提高了鸟群的位置变化活力,提高了算法的有效性。仿真结果表明,在求解高维多极值优化问题时,该算法性能优于原始鸟群算法。

Abstract:

Considering the fact that the original Bird Swarm Algorithm(BSA) in optimizing high-dimensional multi-extreme value easily gets locally optimal solution and premature convergence, an improved algorithm, Levy-Bird Swarm Algorithm(LBSA) is proposed, which is based on Levy flight, a simulation of the birds flying. LBSA replaces the random location changes in the original algorithm by using Levy flight to update the flight locations, which substantially increases the vitality of the location changes, and makes the algorithm more effective. The results of simulation show that the LBSA outperforms the original BSA in optimizing high-dimensional multi-extreme value.