交通网络中最短路径算法分析与探讨

Analysis of shortest path algorithms for transportation networks

通过对交通网络本身特点的分析与研究,介绍了一些适合道路网的经典最短路径算法和数据存贮模式,探讨了在交通网络路线优化过程中需要特别处理的几个问题,如路口延误、禁行状态等,在理论上给出了相应的解决方案,并提出了一个路径搜索的实例.

According to characteristics of the transportation networks, some classical shortest path algorithms and data storage model suitable for road networks are introduced, and several special problems which need to be treated in the routing planning for the arteries of communication, such as the intersection delay and the forbidden state in road networks, are discussed, and the corresponding solutions are given theoretically. Finally, a path search example is given.