摘要
研究了物流运输中的最短路径优化问题,提供了优化后的Dijkstra算法。该算法能比较直观地求出了一个顶点到其它各顶点的所有最短路径。提出的算法和验证结果一致。同时构建了具有高质量和高鲁棒性(robustness)的问题求解算法。该研究成果可以用于解决运输车辆路的径问题,对提高运输经营管理水平和降低运输成本具有重要的理论意义和现实价值。
Optimization problem of shortest path in logistics is proposed in the paper. A modified Dijkstra algorithm is used to get the shortest path from one node to others. The optimized Dijkstra algorithm is verified through examples,which is consistent with the proposed algorithm. Moreover, an algorithm of high quality and high robustness is constructed. The results can be used in solving transportation path problem and has important theoretical and realistic value in improving management and reducing transportation costs.
出处
《计算机时代》
2012年第2期10-12,共3页
Computer Era
