| 双权值最短路径问题的一种解决算法 |
| |
| 引用本文： | 尚靖.双权值最短路径问题的一种解决算法[J].天津市财贸管理干部学院学报,2008,10(2). |
| |
| 作者姓名： | 尚靖 |
| |
| 作者单位： | 天津师范大学初等教育学院,天津,300387 |
| |
| 摘 要： | 物流配送方案中,费用、时间是客户最关心的两个问题。物流企业需要基于这两个客户所关心的问题,提出一套低成本的物流配送方案。本文探求使用费用、时间双权值有向图最短路径问题,解决这种配送方案,并进行算法的时间复杂度分析。
|
| 关 键 词： | 双权值 最短路径 迪杰斯特拉算法 |
On the Shartest Path in Direction Diagram by Dud Weight |
| |
| SHANG Jing.On the Shartest Path in Direction Diagram by Dud Weight[J].Journal of Tianjin Institute of Financial and Commercial Management,2008,10(2). |
| |
| Authors: | SHANG Jing |
| |
| Institution: | SHANG Jing (Tianjin Norm University,Tianjin 300387) |
| |
| Abstract: | The two key points the customer care are charge & time. It is the most important thing for logistics company to provide his customer a low-price solution. In order to solve the logistics problem,we try using shortest path in direction diagram by dual weight (charge & time). And then do time complexity for the algorithm. |
| |
| Keywords: | dual weight path shortest dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
