| 基于Dijkstra算法的物流配送系统最短路径程序设计 |
| |
| 引用本文： | 田晟.基于Dijkstra算法的物流配送系统最短路径程序设计[J].交通标准化,2009(13):89-92. |
| |
| 作者姓名： | 田晟 |
| |
| 作者单位： | 华南理工大学土木与交通学院; |
| |
| 摘 要： | 两点之间的最短路径算法是物流配送系统涉及的最基本算法。基于Dijkstra算法的基本原理，提出一种物流配送系统最短路径设计，包括配送路线图的数据输入模块、配送路线图的主体模块，最终得出输出结果，获得任意多个结点之间的最佳路径，从而能有效提高配送效率．降低配送成本。
|
| 关 键 词： | 物流配送 Dijkstra算法 最短路径 |
The Shortest Path Design on Logistics Distribution System Based on Dijkstra＇s Calculation Method |
| |
| TIAN Sheng.The Shortest Path Design on Logistics Distribution System Based on Dijkstra＇s Calculation Method[J].Communications Standardization,2009(13):89-92. |
| |
| Authors: | TIAN Sheng |
| |
| Institution: | School of Civil Engineering and Transportation;South China University of Technology;Guangzhou 510641;China |
| |
| Abstract: | The shortest path between two points is the most basic calculation method on logistics distribution system. The best traveling line among many distribution points is decided by calculating the shortest path between two points based on basic principle of Dijkstra, including data inputing module and main module of distribution route chart, and then obtaining the output results and the best path among many nodes at random. Thus it leads to improving the distribution efficiency and reducing cost effectively. |
| |
| Keywords: | logistics distribution Dijkstra＇s calculation method shortest path |
| 本文献已被 CNKI 维普 等数据库收录！ |
