基于物流配送系统的运输路径分析及应用

物流配送系统中运输路径的优化研究对于节约物流成本、提高物流效率有着重要的意义。经典Dijkstra算法在求解最短网络中两点间最短路径时，需要计算大量与最短路径无关的结点间的路径。占用了大量计算机的内存。本文在此基础上提出了改进算法，该算法避免使用含有大量无穷值的关联矩阵，节省了内存，使之更适合处理带有拐向限制和包含大量结点信息的最短路径问题。

The Analysis and Application of Transportation-Route in the System of Goods Delivery

In order to save the cost of logistics and improve efficiency, it is very important to make a study on optimizing transportation route in logistics system. When we calculate the shortest route of the network by classical Dijkstra arithmetic, we need to calculate the route-lengths between nodal points which are unrelated to the shortest routes. In that way, it occupies much EMS memory of the computer. Based on this, the author introduced a kind of improved arithmetic, which economized EMS memory by avoiding using the correlative matrices which include much infinitude. It is more suitable to resolve the shortest route problems of the network which includes the restriction to the direction and has a large number of nodal points.