Abstract: By analyzing the problem of logistics, this paper proposes a way of dispatching material on the basis of two-layer distribution center. When dispatching the materials, the side of supplier has to pass through two layers of distribution center to reach the side of demander, otherwise it will be punished. On the basis of establishing the model of four-layer logistics network, which includes the sides of supplier and demander, also two layers of distribution center, this paper uses the Dijkstra algorithm to obtain the shortest transport distance between the point of supplier point and the point of demander, and conversion into the balance chart of supply and demand, then it makes use of algorithm which combines the Tabular method and save-mileage method to solve the model of four-layer logistics network. Experimental results show that the algorithm can guarantee the least total cost of transportation. At the same time, it can effectively reduce the number of vehicle schedule in the process of delivery.

Key words: Tabular method, material distribution, logistics network model Dijkstra algorithm, saving mileage algorithm, minimum element method

摘要： 在分析物流配送物资问题的基础上，提出一种基于两层物流配送中心的物资配送方法。供应方在配送物资时需经过两层配送中心到达需求方，否则将予以惩罚。在建立供应方、两层物流配送中心及需求方四层物流网络模型的基础上，采用Dijkstra算法求出从各供应点到各需求点的最短运输距离并将其转化在供需平衡表中，采用表上作业法和节约里程法相结合的算法求解四层物流网络模型。结合算例计算验证，该算法在保证运输总费用最少的同时可有效地减少配送过程中车辆调度的次数。

关键词: 表上作业法, 物资配送, 物流网络模型, Dijkstra算法, 节约里程算法, 最小元素法

CLC Number: 

• TB114.1