Institutional Repository
| Efficient route search on hierarchical dynamic road networks | |
| Xu, Jiajie (1); Gao, Yunjun (2); Liu, Chengfei (3); Zhao, Lei (1); Ding, Zhiming (4); Gao, Y.(gaoyj@zju.edu.cn) | |
| 2014 | |
| Source | Distributed and Parallel Databases
 |
| ISSN | 9268782 |
| English Abstract | The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. © 2014 Springer Science+Business Media New York.; The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. © 2014 Springer Science+Business Media New York. |
| Indexed Type | EI |
| Department | (1) School of Computer Science, Soochow University, Suzhou, China; (2) College of Computer Science, Zhejiang University, 38 Zheda Road, Hangzhou, 310027, China; (3) Faculty of ICT, Swinburne University of Technology, 38 Zheda Road, Melbourne, VIC, Australia; (4) Institute of Software, Chinese Academy of Sciences, 38 Zheda Road, Beijing, China |
| Language | 英语 |
| WOS ID | WOS:000353468500005 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17019 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Gao, Y.(gaoyj@zju.edu.cn) |
| Recommended Citation GB/T 7714 | Xu, Jiajie ,Gao, Yunjun ,Liu, Chengfei ,et al. Efficient route search on hierarchical dynamic road networks[J]. Distributed and Parallel Databases,2014. |
| APA | Xu, Jiajie ,Gao, Yunjun ,Liu, Chengfei ,Zhao, Lei ,Ding, Zhiming ,&Gao, Y..(2014).Efficient route search on hierarchical dynamic road networks.Distributed and Parallel Databases. |
| MLA | Xu, Jiajie ,et al."Efficient route search on hierarchical dynamic road networks".Distributed and Parallel Databases (2014). |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment