实际配送中多个配送点闭回路最短路径的选取

Most short-path selection of many allocation loop circuit in actual allocation

将Dijkstra算法与Kruskal算法相结合求由配送中心到多个销售点然后返回配送中心最短的闭路径,比单一的用Dijkstra算法和Floyd算法简单,比单一的用Kruskal算法精确,从而给实际计算带来方便。

Unify the Dijkstra algorithm and the Kruskal algorithm to find the most short-path of many allocation loop circuit in actual allocation,is easier than only use the Dijkstra algorithm or the Floyd algorithm, and is more precise than only use the Kruskal algorithm which can bring convenient for our calculation.