| 实际配送中多个配送点闭回路最短路径的选取 |
| |
| 引用本文： | 吴群妹. 实际配送中多个配送点闭回路最短路径的选取[J]. 大庆师范学院学报, 2009, 29(6): 33-36 |
| |
| 作者姓名： | 吴群妹 |
| |
| 作者单位： | 江南大学信息工程学院,江苏,无锡,214028 |
| |
| 摘 要： | 将Dijkstra算法与Kruskal算法相结合求由配送中心到多个销售点然后返回配送中心最短的闭路径,比单一的用Dijkstra算法和Floyd算法简单,比单一的用Kruskal算法精确,从而给实际计算带来方便。
|
| 关 键 词： | Dijkstra算法 Floyd算法 Kruskal算法 最小生成树 最短距离 |
Most short-path selection of many allocation loop circuit in actual allocation |
| |
| WU Qun-mei. Most short-path selection of many allocation loop circuit in actual allocation[J]. Journal of Daqing Normal University, 2009, 29(6): 33-36 |
| |
| Authors: | WU Qun-mei |
| |
| Abstract: | 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. |
| |
| Keywords: | Dijkstra algorithm Floyd algorithm Kruskal algorithm Smallest spanning tree Most short distance |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
