This paper presents an improved Dijkstra algorithm considering turn delays at intersections and establishes a UE traffic assignment algorithm based on the improved shortest path algorithm. The improved shortest algorithm identifies the turn delay by recording the previous node of each node in the path iteration process. And the time complexity of this algorithm is optimized from O(n2) to O(n log n) through heap optimization. A MATLAB program is realized and is validated through a real urban road network in Xi’an. The result shows 1.The shortest path algorithm used in this paper can sensitively identify intersection delays; considering turn delay in the shortest algorithm is more realistic. 2. Considering the intersection delay in the traffic assignment will not affect convergence performance too much. Moreover, the traffic assignment results may change when turn delays are considered.

CICTP