Abstract
The travel time of each link of a traffic network is estimated or forecast to find the optimal route in a dynamic route guidance system. U-turn and P-turn as well as left-turn restriction exist in Korean traffic networks. The optimal route should be selected for considering these by shortest path algorithms using estimated travel time. But, the traditional algorithms have some limitations to use for considering these. Floyd-Warshall algorithm is selected and modified because of the simplicity, intuitive appeal, and ease of implementation. This algorithm is used to find the all pairs shortest path in dynamic traffic network considering the left-turn restriction, U-turn, and P-turn in this paper. (A*)