Shortest path generation method of urban traffic network considering traffic convenience

The shortest path problem is an important problem in traffic network analysis, and is also the basis of resource allocation, route design and other optimization problems. In this paper, a method of shortest path generation in urban traffic network considering traffic convenience is proposed. The traffic congestion is analyzed by phase saturation and area saturation. According to the transportation capacity of the intermediate stations in the transportation network, the number of the intermediate stations in the transportation network is calculated, the total passenger flow in the transportation area is obtained, and the starting and ending points of the transportation network are determined. Taking the starting and ending points of the urban transportation network as the nodes of the urban transportation network, the topological structure of the urban transportation network is constructed, and the shortest path generation model of the urban transportation network is established by using the edge sequence search algorithm, the shortest path of urban transportation network considering traffic convenience is generated. The simulation results show that the shortest path generation time of the proposed method is short, the generation accuracy is high, and the highest accuracy is 95%. This method provides a theoretical basis for the effective improvement of traffic congestion.