基于蚁群算法的物流配送避障路径规划方法

Obstacle-avoided Route Planning of Physical Distribution Based on Ant Colony Algorithm

针对物流配送路径规划问题,以可视图法所建的求解环境为基础,利用蚁群优化算法,提出了一种在障碍物环境下求任意两点间的最短路径方法,算法采用了优势个体指导机制,保证了最优解的搜索能力和解的全局收敛性。实验结果证明,该算法收敛快,可靠性高。与传统算法相比,该算法具有全局最优解方面的高效性,明显提高了路径搜索效率。

Aiming at the route planning of physical distribution and based on the problem-solved environment of visible graph, the paper proposes a method of solving the shortest route between two arbitrary points in an environment of obstacles with the Ant Colony optimized algorithm.