Analysis and algorithm improvement of the shortest path critical turning problem in urban road networks

This study provides a detailed exploration of the dominant trend of the shortest path in the road traffic system, with the aim of studying the effect of OD on the optimal driving route between intersections where directionality is obstructed or cannot be passed normally due to severe obstacles. The urban road network is summarized as a directed weight network with directional weights, and on this basis, the key turns of the shortest path are determined. We optimized the traditional Dijkstra algorithm and created an efficient algorithm using arc symbols to find the shortest route and important turns in this network structure. Ultimately, we demonstrate and analyze the effectiveness of the algorithm through practical cases.