论文部分内容阅读
为了解决车辆诱导系统中复杂道路结构表达及因为城市道路交通信号管理而产生的最优路径选择求解的复杂性,依据图论中最短路径算法的基本原理,提出了含有禁行路线路网的最优路径求解算法。以行程时间最少为目标,按照网络转化法把含有禁行路线的路网转化为不含有禁行路线的路网,采用邻接节点矩阵和邻接节点权矩阵实现了道路节点关系的表达,改善了传统的Di jkstra算法,将全局节点路径的求解转化为与求解节点紧密联系的局部区域求解,将所研究的网络转化方法和改进的路径寻优算法应用于车辆诱导系统。结果表明应用该算法能够在含有禁行路线的路网中求解最优路径,减少了问题求解的路网节点数,提高了计算效率。
In order to solve the complexity of solving the optimal path selection of complex road structures in the vehicle guidance system and the urban road traffic signal management, according to the basic principle of the shortest path algorithm in graph theory, Optimal path solving algorithm. In order to minimize the travel time, the road network with the no-break route is converted into a road network with no-break route according to the network transformation method. The adjacent node matrix and the adjacent node weight matrix are used to express the relationship of the road nodes, Dijkstra algorithm is used to transform the global node path solution into local area solution which is closely connected with the solution node. The network transformation method and the improved path optimization algorithm are applied to the vehicle guidance system. The results show that the proposed algorithm can solve the optimal path in the road network with prohibited routes, reduce the number of nodes in the road network and improve the computational efficiency.