ISCAS OpenIR
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
发表期刊Distributed and Parallel Databases
ISSN9268782
摘要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.
收录类别EI
部门归属(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
语种英语
WOS记录号WOS:000353468500005
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/17019
专题中国科学院软件研究所
通讯作者Gao, Y.(gaoyj@zju.edu.cn)
推荐引用方式
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).
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Xu, Jiajie (1)]的文章
[Gao, Yunjun (2)]的文章
[Liu, Chengfei (3)]的文章
百度学术
百度学术中相似的文章
[Xu, Jiajie (1)]的文章
[Gao, Yunjun (2)]的文章
[Liu, Chengfei (3)]的文章
必应学术
必应学术中相似的文章
[Xu, Jiajie (1)]的文章
[Gao, Yunjun (2)]的文章
[Liu, Chengfei (3)]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。