Considering the shortcomings of traditional artificial bee colony algorithm in slow convergence and easily falling into local optimum, this paper presents an optimized artificial bee colony algorithm, and use it to solve the shortest path planning problem. First, the artificial bee colony algorithm is designed to solve the shortest path planning problem. Second, the genetic hybrid genes, elite reserved strategy, and dynamic scout bees are introduced to improve the performance of traditional artificial bee colony algorithm. Finally, the proposed optimized artificial bee colony algorithm is compared with the traditional bee colony algorithm for solving the same problem in the tested area. The results show that the optimized artificial bee colony algorithm has a better performance than the traditional artificial bee colony algorithm in solving the shortest path planning problem.
展开▼
