Skip to main content

Advertisement

SpringerLink
Log in

Fast stochastic routing under time-varying uncertainty

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Data are increasingly available that enable detailed capture of travel costs associated with the movements of vehicles in road networks, notably travel time, and greenhouse gas emissions. In addition to varying across time, such costs are inherently uncertain, due to varying traffic volumes, weather conditions, different driving styles among drivers, etc. In this setting, we address the problem of enabling fast route planning with time-varying, uncertain edge weights. We initially present a practical approach to transforming GPS trajectories into time-varying, uncertain edge weights that guarantee the first-in-first-out property. Next, we propose time-dependent uncertain contraction hierarchies (TUCHs), a generic speed-up technique that supports a wide variety of stochastic route planning functionality in the paper’s setting. In particular, we propose query processing methods based on TUCH for two representative types of stochastic routing: non-dominated routing and probabilistic budget routing. Experimental studies with a substantial GPS data set offer insight into the design properties of the paper’s proposals and suggest that they are capable of enabling efficient stochastic routing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. http://www.openstreetmap.org/

References

  1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.F.: A hub-based labeling algorithm for shortest paths in road networks. In: SEA, pp. 230–241 (2011)

  2. Aljubayrin, S., Yang, B., Jensen, C.S., Zhang, R.: Finding non-dominated paths in uncertain road networks. In: ACM SIGSPATIAL, pp. 15:1–15:10 (2016)

  3. Andonov, G., Yang, B.: Stochastic shortest path finding in path-centric uncertain road networks. In: MDM, pp. 40–45 (2018)

  4. Asghari, M., Emrich, T., Demiryurek, U., Shahabi, C.: Probabilistic estimation of link travel times in dynamic road networks. In: SIGSPATIAL, pp. 47:1–47:10 (2015)

  5. Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route Planning in Transportation Networks, pp. 19–80. Springer, New York (2016)

    Google Scholar 

  6. Chen, A., Ji, Z.: Path planning under uncertainty. J. Adv. Transp. 39, 19–37 (2005)

    Article  Google Scholar 

  7. Chowdhury, F.N., Kolber, Z.S., Barkley, M.D.: Monte Carlo convolution method for simulation and analysis of fluorescence decay data. Rev. Sci. Instrum. 62(1), 47–52 (1991)

    Article  Google Scholar 

  8. Dai J., Yang B., Guo C., Ding Z.: Personalized route recommendation using big trajectory data. In: ICDE, pp. 543–554 (2015)

  9. Dai, J., Yang, B., Guo, C., Jensen, C.S., Hu, J.: Path cost distribution estimation using trajectory data. PVLDB 10(3), 85–96 (2016)

    Google Scholar 

  10. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  11. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)

  12. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: WEA, pp. 319–333 (2008)

  13. George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191–212 (2006)

    Google Scholar 

  14. Guo, C., Ma, Y., Yang, B., Jensen, C.S., Kaul, M.: Ecomark: evaluating models of vehicular environmental impact. In: ACM SIGSPATIAL, pp. 269–278 (2012)

  15. Guo, C., Jensen, C.S., Yang, B.: Towards total traffic awareness. SIGMOD Record 43(3), 18–23 (2014)

    Article  Google Scholar 

  16. Guo, C., Yang, B., Andersen, O., Jensen, C.S., Torp, K.: Ecomark 2.0: empowering eco-routing with vehicular environmental models and actual vehicle fuel consumption data. GeoInformatica 19(3), 567–599 (2015)

    Article  Google Scholar 

  17. Guo, C., Yang, B., Hu, J., Jensen, C.S.: Learning to route with sparse trajectory sets. In: ICDE, pp. 1073–1084 (2018)

  18. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)

    Article  Google Scholar 

  19. Heyde, C.C.: Central Limit Theorem. Wiley, New York (2014)

    Book  Google Scholar 

  20. Hu, J., Guo, C., Yang, B., Jensen, C.S.: Stochastic weight completion for road networks using graph convolutional networks. In: ICDE, pp. 1274–1285 (2019)

  21. Hu, J., Yang, B., Guo, C., Jensen, C.S.: Risk-aware path selection with time-varying, uncertain travel costs: a time series approach. VLDB J. 27(2), 179–200 (2018)

    Article  Google Scholar 

  22. Hu, J., Yang, B., Jensen, C.S., Ma, Y.: Enabling time-dependent uncertain eco-weights for road networks. GeoInformatica 21(1), 57–88 (2017)

    Article  Google Scholar 

  23. Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp. 347–358 (2010)

  24. Idé, T., Sugiyama, M.: Trajectory regression on road networks. In: AAAI, pp. 203–208 (2011)

  25. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE, pp. 10–20 (2006)

  26. Kelareva, E.: Predicting the Future with Google Maps APIs. (2015) http://googlegeodevelopers.blogspot.dk/2015/11/predicting-future-with-google-maps-apis.html

  27. Kieu, T., Yang, B., Guo, C., Jensen, C.S.: Distinguishing trajectories from different drivers using incompletely labeled trajectories. In: CIKM, pp. 863–872 (2018)

  28. Kieu, T., Yang, B., Guo, C., Jensen, C.S.: Outlier detection for time series with recurrent autoencoder ensembles. In: IJCAI, pp. 2725–2732 (2019)

  29. Kieu, T., Yang, B., Jensen, C.S.: Outlier detection for multidimensional time series using deep neural networks. In: MDM, pp. 125–134 (2018)

  30. Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: WEA, pp. 126–138 (2005)

  31. Letchner, J., Krumm, J., Horvitz, E.: Trip router with individualized preferences (TRIP): incorporating personalization into route planning. In: AAAI, pp. 1795–1800 (2006)

  32. Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes. In: ICDE, pp. 569–580 (2018)

  33. Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE TKDE 30(3), 488–502 (2018)

    Google Scholar 

  34. Miller-Hooks, E., Mahmassani, H.S.: Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transp. Res. Rec. J. Transp. Res. Board 1645(1), 143–151 (1998)

    Article  Google Scholar 

  35. Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: ICAPS, pp. 131–141 (2006)

  36. Nussbaumer, H.: Fast Fourier Transform and Convolution Algorithms. Springer Series in Information Sciences. Springer, New York (2012)

    MATH  Google Scholar 

  37. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. ACM 37(3), 607–625 (1990)

    MathSciNet  MATH  Google Scholar 

  38. Pereira, F.C., Costa, H., Pereira, N.M.: An off-line map-matching algorithm for incomplete map databases. Eur. Transp. Res. Rev. 1(3), 107–124 (2009)

    Article  MathSciNet  Google Scholar 

  39. Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp. 949–960 (2013)

  40. Wellman, M.P., Ford, M., Larson, K.: Path planning under time-dependent uncertainty. In: UAI, pp. 532–539 (1995)

  41. Yang, B., Guo, C., Jensen, C.S.: Travel cost inference from sparse, spatio-temporally correlated time series using markov moddels. PVLDB 6(9), 769–780 (2013)

    Google Scholar 

  42. Yang, B., Dai, J., Guo, C., Jensen, C.S., Hu, J.: PACE: a path-centric paradigm for stochastic path finding. VLDB J. 27(2), 153–178 (2018)

    Article  Google Scholar 

  43. Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: ICDE, pp. 136–147 (2014)

  44. Yang, B., Guo, C., Ma, Y., Jensen, C.S.: Toward personalized, context-aware routing. VLDB J. 24(2), 297–318 (2015)

    Article  Google Scholar 

  45. Yang, B., Kaul, M., Jensen, C.S.: Using incomplete information for complete weight annotation of road networks. IEEE TKDE 26(5), 1267–1279 (2014)

    Google Scholar 

  46. Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)

    Article  MathSciNet  Google Scholar 

  47. Yuan, J., Zheng, Y., Xie, X., Sun, G.: T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE TKDE 25(1), 220–232 (2013)

    Google Scholar 

  48. Zheng, K., Zhao, Y., Lian, D., Zheng, B., Liu, G., Zhou, X.: Reference-based framework for spatio-temporal trajectory compression and query processing. In: IEEE TKDE (2019)

  49. Zheng, K., Zheng, Y., Yuan, N.J., Shang, S., Zhou, X.: Online discovery of gathering patterns over trajectories. IEEE TKDE 26(8), 1974–1988 (2014)

    Google Scholar 

Download references

Acknowledgements

This research was supported in part by a grant from the Obel Family Foundation, a grant from Independent Research Fund Denmark, and by the DiCyPS center, funded by Innovation Fund Denmark.

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University, Aalborg, Denmark

    Simon Aagaard Pedersen, Bin Yang & Christian S. Jensen

Authors
  1. Simon Aagaard Pedersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian S. Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bin Yang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pedersen, S.A., Yang, B. & Jensen, C.S. Fast stochastic routing under time-varying uncertainty. The VLDB Journal 29, 819–839 (2020). https://doi.org/10.1007/s00778-019-00585-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-019-00585-6

Keywords

Search

Navigation