| Dijkstra算法在后勤补给运输中的应用及其优化 |
| |
| 引用本文： | 官斌,马焱.Dijkstra算法在后勤补给运输中的应用及其优化[J].舰船电子工程,2011,31(8):140-142. |
| |
| 作者姓名： | 官斌 马焱 |
| |
| 作者单位： | 1. 武汉市74223信箱,武汉,430074
2. 海军702厂,上海,200006 |
| |
| 摘 要： | 文章在分析传统Dijkstra算法的基础上,针对传统Dijkstra算法存在的两点不足之处,引入了一种优化算法。当后勤补给运输的网络规模较大及其关联矩阵为一个稀疏矩阵时,以上优化算法与传统Dijkstra算法相比,能大大减少计算次数及比较次数,提高运算效率。
|
| 关 键 词： | Dijkstra算法 后勤补给运输 优化 |
Application of Dijkstra Arithmetic in Logistics Replenishment Transportation and its Optimization |
| |
| Guan Bin Ma Yan,Wuhan ,Shanghai.Application of Dijkstra Arithmetic in Logistics Replenishment Transportation and its Optimization[J].Ship Electronic Engineering,2011,31(8):140-142. |
| |
| Authors: | Guan Bin Ma Yan Wuhan Shanghai |
| |
| Institution: | Guan Bin1) Ma Yan2)(P.O.Box 742231),Wuhan 430074)(Naval 702 Repairing Plant2),Shanghai 200006) |
| |
| Abstract: | The traditional Dijkstra arithmetic is analyzed and the optimization upon this arithmetic is proposed based on its two shortcomings.When the network of logistics replenishment transportation is large and the associated matrix is sparse,the optimal arithme |
| |
| Keywords: | Dijkstra arithmetic logistics replenishment transportation optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
