改进的最短路算法

通过对军事后勤运输中运输路线选择问题的分析 ,提出了最短路模型。针对巨型交通网络的路径选优问题 ,以传统的最短路问题的Dijksta算法理论为基础 ,引入并行处理的概念 ,提出了改进的最短路算法 ,给出了算法的证明推导 ;并对算法效率进行了简单的分析 ,同时用示例对算法进行了计算。新算法在处理巨型网络时效率明显提高 ,为后勤运输路线的选择提供了有力的辅助决策工具

Improved Algorithm of Short-Cut

An analysis is given to the selection of routes in military logistic transportation and a model of short cut is presented. A brief discussion is devoted to gigantic traffic ntwork route optimization. Based on traditional Dijkstra algorithm, a new algorithm introducing parallel processing concept is put forward and its correctness is proved. A simple analysis is made on the efficiency of the algorthm. The application of the algorithm proves that the improved algorithm is effective to handle a gigantic traffic network, which provides an effective means for the selection of routes in military logistic transportation.