论文部分内容阅读
最佳路径选择有利于解决城市交通拥堵。文章在传统Dijkstra算法的基础上,利用双向Dijkstra算法进行最佳路径选择,将算法时间复杂度由O(n2)减少到O(n*(n-1)/2),提高了算法效率。同时根据城市交通网络实时变化的特点,引入时间权值进行网络约束,使网络权值更加全面地反映路段信息。该算法已应用于北京市城市交通路网最短路径选择系统中,应用实例证明了该算法是可行的和准确的。
The best route to choose is good for solving urban traffic congestion. Based on the traditional Dijkstra algorithm, this paper uses the bidirectional Dijkstra algorithm to select the best path and reduces the algorithm complexity from O (n2) to O (n * (n-1) / 2), which improves the efficiency of the algorithm. At the same time, according to the characteristics of real-time changes of urban traffic network, time weights are introduced to restrict the network so that the network weights can reflect the information of road sections more comprehensively. The algorithm has been applied to the shortest path selection system of urban traffic network in Beijing. The application example proves that the algorithm is feasible and accurate.