DocumentCode :
2093091
Title :
An Incremental Query Algorithm for Optimal Path Queries under Traffic Jams
Author :
Song, Xiaoyu ; Yu, Lanyang ; Sun, Huanliang
Author_Institution :
Sch. of Inf. & Control Eng., Shenyang Jianzhu Univ., Shenyang, China
Volume :
1
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
472
Lastpage :
475
Abstract :
With the wide application of global navigation and location technology, people have growing demands of solving the shortest path problem. In the real traffic network, all kinds of traffic information have greatly influenced path searching, such as traffic jams. So existing algorithms just remove the congested road and recompute the path. So the traveler needs to wait for a period of time. In order to solve the optimal path in road network with restricted routes quickly, this paper proposes an incremental algorithm and an optimized algorithm based on A* algorithm. Area Hierarchy Tree and A* search strategy are adopted in these incremental algorithms. The experiments with real datasets show that the incremental algorithm is reliable and highly effective for optimal path planning of real constrained road networks.
Keywords :
query processing; road traffic; search problems; traffic information systems; A* algorithm; A* search strategy; area hierarchy tree; congested road; incremental query algorithm; optimal path queries; road network; shortest path problem; traffic information; traffic jams; Application software; Communication system traffic control; Computer science; Control engineering; Navigation; Roads; Shortest path problem; Sun; Telecommunication traffic; Vehicles; A* algorithm; optimum path; road network; speed pattern;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3746-7
Type :
conf
DOI :
10.1109/ISCSCT.2008.316
Filename :
4731470
Link To Document :
بازگشت