论文部分内容阅读
针对人工蜂群算法在后期容易陷入局部最优,且开发能力不足的缺陷,提出了一种基于Lévy飞行的人工蜂群算法,在寻找蜜源过程中,引领蜂转变成侦查蜂时,引入Lévy分布函数来调配原有的用0-1的随机数参与的贪婪算法,有效增加了算法的合理性。最后用5个有效的测试函数对改进的算法和原算法进行比较,结果表明,基于Lévy分布的人工蜂群算法较原算法在收敛速度和优化速度上都有显著提高。
Aiming at the defect that the artificial bee colony algorithm is easy to fall into the local optimum in the later stage and the development ability is not enough, a artificial bee colony algorithm based on Lévy flight is proposed. When the bee is diverted to beeing the bee, Lévy distribution is introduced Function to deploy the greedy algorithm that uses the random number of 0-1 to participate, which effectively increases the rationality of the algorithm. Finally, five valid test functions are used to compare the improved algorithm with the original one. The results show that the proposed algorithm based on Lévy distribution improves the convergence speed and optimization speed better than the original one.