| 求解路网最短路的快速算法 |
| |
| 引用本文： | 况爱武,易波. 求解路网最短路的快速算法[J]. 佛山科学技术学院学报(自然科学版), 2004, 22(1): 41-44 |
| |
| 作者姓名： | 况爱武 易波 |
| |
| 作者单位： | 长沙理工大学,交通运输学院,湖南,长沙,410076;长沙理工大学,交通运输学院,湖南,长沙,410076 |
| |
| 摘 要： | 探讨了最短路算法在交通分配中的重要地位。在此基础上．比较了现有最短路算法的优缺点，同时提出了一种改进的矩阵迭代算法．并利用该算法对一简单路网进行了验证。
|
| 关 键 词： | 最短路 矩阵迭代 交通分配 算法 |
| 文章编号： | 1008-0171(2004)01-0041-04 |
| 修稿时间： | 2003-05-26 |
A quick algorithm for solving the shortest path of road network |
| |
| KUANG Ai-wu,YI Bo. A quick algorithm for solving the shortest path of road network[J]. Journal of Foshan University(Natural Science Edition), 2004, 22(1): 41-44 |
| |
| Authors: | KUANG Ai-wu YI Bo |
| |
| Abstract: | This paper introduces the important position of shortest path algorithm using in traffic assignment.Based on this,it points out the advantage and disadvantage of the most popular shortest path algorithm at present.At the same time,this paper sets up an improved matrix alternate algorithm.At last,the algorithm is verified by a simple road network. |
| |
| Keywords: | the shortest path alternate matrix traffic assignment algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
