Efficient route search on hierarchical dynamic road networks

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
ISSN	9268782
摘要	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).