Abstract
The current widespread use of GPS navigations and trip planning on web has aroused great interests in fast and scalable path query processing. Recent research has mainly focused on static route optimisation where the traffic network is assumed to be stable. However in most cases, route planning is in 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 effectively support traffic aware route planning. In this paper, a new strategy is proposed to handle this problem. We analysis the traffic condition on the road network and explore spatial-temporal knowledge to guide effective route planning. In particular, a set of effective techniques are used 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 strategy performances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: ICDE 2007, pp. 796–805. IEEE (2007)
Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT 2008, pp. 205–216. ACM (2008)
Gunturi, V.M.V., Nunes, E., Yang, K., Shekhar, S.: A Critical-Time-Point Approach to all-Start-Time Lagrangian Shortest Paths: A Summary of Results. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 74–91. Springer, Heidelberg (2011)
Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT 2010, pp. 347–358. ACM (2010)
Kanoulas, E., et al.: Finding fastest paths on a road network with speed patterns. In: ICDE 2006, p. 10. IEEE (2006)
Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: ICDE 2010, pp. 261–272. IEEE (2010)
Li, F.-f., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On Trip Planning Queries in Spatial Databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)
Malviya, N., Madden, S., Bhattacharya, A.: A continuous query system for dynamic route planning. In: ICDE 2011, pp. 792–803. IEEE Computer Society (2011)
Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB 4(2), 69–80 (2010)
Xiao, Y., et al.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT 2009, pp. 493–504. ACM (2009)
Potamias, M., et al.: Fast shortest path distance estimation in large networks. In: CIKM 2009, pp. 867–876. ACM (2009)
Gao, J., et al.: Fast top-k simple shortest paths discovery in graphs. In: CIKM 2010, pp. 509–518. ACM (2010)
Likhachev, M., et al.: Anytime dynamic A*: An anytime, replanning algorithm. In: ICAPS 2005, pp. 262–271 (2005)
Bast, H., et al.: In transit to constant time shortest-path queries in road networks. In: ALENEX (2007)
Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1-2), 93–146 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, J., Guo, L., Ding, Z., Sun, X., Liu, C. (2012). Traffic Aware Route Planning in Dynamic Road Networks. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29038-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-29038-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29037-4
Online ISBN: 978-3-642-29038-1
eBook Packages: Computer ScienceComputer Science (R0)