原文传递 A study on shortest path algorithm for route guidance in traffic network including left-turn restriction, U-turn and P-turn.
题名: A study on shortest path algorithm for route guidance in traffic network including left-turn restriction, U-turn and P-turn.
作者: KIM-S-S (Kangwon Nat Univ, Korea); LEE-J-H (Korea Telecom, Korea); CHEON-W-B (Korea Telecom, Korea); BYEON-ESB (Sunmoon Univ, Asansi, Korea)
关键词: CONFERENCE-; 8525-; INTELLIGENT-TRANSPORT-SYSTEM; 8735-; CALCULATION-; 6464-; METHOD-; 9102-; ROUTE-GUIDANCE; 8771-; REPUBLIC-OF-KOREA; 8092-; TRAFFIC-CONTROL; 0658-; JUNCTION-; 0455-; TURN-; 0638-; JOURNEY-TIME; 0697-
摘要: 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*) For the covering abstract see ITRD E110327.
总页数: PROCEEDINGS OF 6TH WORLD CONGRESS ON INTELLIGENT TRANSPORT SYSTEMS (ITS), HELD TORONTO, CANADA, NOVEMBER 8-12, 1999. 1999. pp-
报告类型: 科技报告
检索历史
应用推荐