基于改进Dijkstra算法的仓储拣选最优路径规划研究

Research on optimal path planning of warehouse picking based on improved Dijkstra algorithm

Dijkstra(迪科斯彻)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径,其主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法。文章研究了叉车在仓储作业选择最优路径的问题,主要根据仓储巷道交通网络数据,建立数学模型,确定叉车仓储作业的最优路径,并且对模型的优缺点进行分析,提出改进方法,以更好地研究叉车仓储作业的最优路径选择问题。本研究选出在仓储巷道作业车辆从起点到终点的最优路径。结果表明,Dijkstra算法能够计算出车辆作业的最优线路,对现场的司机指导、工作效率提高提供了很好的支持。

Dijkstra algorithm is a typical single source shortest path algorithm,which is used to calculate the shortest path from one node to all other nodes.The main feature is to expand outward layer by layer from the starting point to the end point.Dijkstra algorithm is a representative shortest path algorithm.This paper studies the problem of selecting the optimal path for forklift storage operations,mainly based on the data of storage roadway traffic network,establishes a mathematical model,determines the optimal path for forklift storage operations,analyzes the advantages and disadvantages of the model,and proposes an improved method to better study the optimal path selection problem for forklift storage operations.Select the optimal path from the starting point to the end point for vehicles working in the storage roadway.The results show that Dijkstra algorithm can calculate the optimal route of vehicle operation,which provides good support for on-site driver guidance and work efficiency improvement.