论文部分内容阅读
就城市路网动态时间最短路径诱导系统的实现展开研究。针对邻接表和邻接矩阵在保存完整的路网信息时出现高冗余并导致算法计算时间成倍增加的现象,以改进的前向关联边结构作为路网的存储结构,并依此对Dijkstra算法进行改进,用于路网节点之间动态时间最短路径的求取。在此基础上,基于市区实时交通流数据和相位配时信息,结合高精度交通电子地图,开发了东莞市动态路径诱导系统进行实验仿真。该系统针对改进后的算法与原算法的差异,设置了静态和动态两种最短路径计算模式,对两种模式的计算时间和计算结果进行了对比。结果表明改进算法能够在不增加时间复杂度的前提下,充分考虑动态交通流状况、交叉口限向和转向延误,有效解决城市路网动态时间最短路径问题。
The research on the realization of the shortest path guidance system of urban road network with dynamic time is studied. Aiming at the phenomenon that the adjacency list and the adjacency matrix have high redundancy when saving the complete road network information and the algorithm computation time is multiplied, the improved forward edge correlation structure is used as the storage structure of the road network and the Dijkstra algorithm To be improved for the calculation of the shortest dynamic path between nodes in the network. On this basis, based on the real-time urban traffic flow data and phase allocation information, combined with high-precision traffic electronic map, the dynamic path guidance system in Dongguan was developed to simulate the experiment. The system for the difference between the improved algorithm and the original algorithm, set the static and dynamic two shortest path calculation mode, the two modes of calculation time and calculation results were compared. The results show that the improved algorithm can fully consider the dynamic traffic flow conditions, the limit of intersection and the steering delay under the premise of not increasing the time complexity, and effectively solve the problem of the shortest dynamic path of urban road network.