Skip to main content
Erschienen in: The VLDB Journal 4/2020

31.10.2019 | Regular Paper

Fast stochastic routing under time-varying uncertainty

verfasst von: Simon Aagaard Pedersen, Bin Yang, Christian S. Jensen

Erschienen in: The VLDB Journal | Ausgabe 4/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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) 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.
Zurück zum Zitat 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) 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.
Zurück zum Zitat Andonov, G., Yang, B.: Stochastic shortest path finding in path-centric uncertain road networks. In: MDM, pp. 40–45 (2018) Andonov, G., Yang, B.: Stochastic shortest path finding in path-centric uncertain road networks. In: MDM, pp. 40–45 (2018)
4.
Zurück zum Zitat 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) 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.
Zurück zum Zitat 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) 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)
6.
Zurück zum Zitat Chen, A., Ji, Z.: Path planning under uncertainty. J. Adv. Transp. 39, 19–37 (2005)CrossRef Chen, A., Ji, Z.: Path planning under uncertainty. J. Adv. Transp. 39, 19–37 (2005)CrossRef
7.
Zurück zum Zitat 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)CrossRef 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)CrossRef
8.
Zurück zum Zitat Dai J., Yang B., Guo C., Ding Z.: Personalized route recommendation using big trajectory data. In: ICDE, pp. 543–554 (2015) Dai J., Yang B., Guo C., Ding Z.: Personalized route recommendation using big trajectory data. In: ICDE, pp. 543–554 (2015)
9.
Zurück zum Zitat Dai, J., Yang, B., Guo, C., Jensen, C.S., Hu, J.: Path cost distribution estimation using trajectory data. PVLDB 10(3), 85–96 (2016) Dai, J., Yang, B., Guo, C., Jensen, C.S., Hu, J.: Path cost distribution estimation using trajectory data. PVLDB 10(3), 85–96 (2016)
10.
11.
Zurück zum Zitat Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008) Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)
12.
Zurück zum Zitat Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: WEA, pp. 319–333 (2008) 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.
Zurück zum Zitat George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191–212 (2006) George, B., Shekhar, S.: Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. 11, 191–212 (2006)
14.
Zurück zum Zitat 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) 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.
Zurück zum Zitat Guo, C., Jensen, C.S., Yang, B.: Towards total traffic awareness. SIGMOD Record 43(3), 18–23 (2014)CrossRef Guo, C., Jensen, C.S., Yang, B.: Towards total traffic awareness. SIGMOD Record 43(3), 18–23 (2014)CrossRef
16.
Zurück zum Zitat 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)CrossRef 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)CrossRef
17.
Zurück zum Zitat Guo, C., Yang, B., Hu, J., Jensen, C.S.: Learning to route with sparse trajectory sets. In: ICDE, pp. 1073–1084 (2018) Guo, C., Yang, B., Hu, J., Jensen, C.S.: Learning to route with sparse trajectory sets. In: ICDE, pp. 1073–1084 (2018)
18.
Zurück zum Zitat 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)CrossRef 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)CrossRef
19.
20.
Zurück zum Zitat 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) 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.
Zurück zum Zitat 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)CrossRef 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)CrossRef
22.
Zurück zum Zitat Hu, J., Yang, B., Jensen, C.S., Ma, Y.: Enabling time-dependent uncertain eco-weights for road networks. GeoInformatica 21(1), 57–88 (2017)CrossRef Hu, J., Yang, B., Jensen, C.S., Ma, Y.: Enabling time-dependent uncertain eco-weights for road networks. GeoInformatica 21(1), 57–88 (2017)CrossRef
23.
Zurück zum Zitat Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp. 347–358 (2010) Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp. 347–358 (2010)
24.
Zurück zum Zitat Idé, T., Sugiyama, M.: Trajectory regression on road networks. In: AAAI, pp. 203–208 (2011) Idé, T., Sugiyama, M.: Trajectory regression on road networks. In: AAAI, pp. 203–208 (2011)
25.
Zurück zum Zitat Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE, pp. 10–20 (2006) Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE, pp. 10–20 (2006)
27.
Zurück zum Zitat Kieu, T., Yang, B., Guo, C., Jensen, C.S.: Distinguishing trajectories from different drivers using incompletely labeled trajectories. In: CIKM, pp. 863–872 (2018) 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.
Zurück zum Zitat Kieu, T., Yang, B., Guo, C., Jensen, C.S.: Outlier detection for time series with recurrent autoencoder ensembles. In: IJCAI, pp. 2725–2732 (2019) 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.
Zurück zum Zitat Kieu, T., Yang, B., Jensen, C.S.: Outlier detection for multidimensional time series using deep neural networks. In: MDM, pp. 125–134 (2018) Kieu, T., Yang, B., Jensen, C.S.: Outlier detection for multidimensional time series using deep neural networks. In: MDM, pp. 125–134 (2018)
30.
Zurück zum Zitat Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: WEA, pp. 126–138 (2005) 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.
Zurück zum Zitat Letchner, J., Krumm, J., Horvitz, E.: Trip router with individualized preferences (TRIP): incorporating personalization into route planning. In: AAAI, pp. 1795–1800 (2006) Letchner, J., Krumm, J., Horvitz, E.: Trip router with individualized preferences (TRIP): incorporating personalization into route planning. In: AAAI, pp. 1795–1800 (2006)
32.
Zurück zum Zitat Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes. In: ICDE, pp. 569–580 (2018) Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes. In: ICDE, pp. 569–580 (2018)
33.
Zurück zum Zitat Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE TKDE 30(3), 488–502 (2018) Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE TKDE 30(3), 488–502 (2018)
34.
Zurück zum Zitat 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)CrossRef 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)CrossRef
35.
Zurück zum Zitat Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: ICAPS, pp. 131–141 (2006) Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: ICAPS, pp. 131–141 (2006)
36.
Zurück zum Zitat Nussbaumer, H.: Fast Fourier Transform and Convolution Algorithms. Springer Series in Information Sciences. Springer, New York (2012)MATH Nussbaumer, H.: Fast Fourier Transform and Convolution Algorithms. Springer Series in Information Sciences. Springer, New York (2012)MATH
37.
Zurück zum Zitat Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. ACM 37(3), 607–625 (1990)MathSciNetMATH Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. ACM 37(3), 607–625 (1990)MathSciNetMATH
38.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
39.
Zurück zum Zitat Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp. 949–960 (2013) Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: ICDE, pp. 949–960 (2013)
40.
Zurück zum Zitat Wellman, M.P., Ford, M., Larson, K.: Path planning under time-dependent uncertainty. In: UAI, pp. 532–539 (1995) Wellman, M.P., Ford, M., Larson, K.: Path planning under time-dependent uncertainty. In: UAI, pp. 532–539 (1995)
41.
Zurück zum Zitat 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) 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)
42.
Zurück zum Zitat 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)CrossRef 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)CrossRef
43.
Zurück zum Zitat 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) 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.
Zurück zum Zitat Yang, B., Guo, C., Ma, Y., Jensen, C.S.: Toward personalized, context-aware routing. VLDB J. 24(2), 297–318 (2015)CrossRef Yang, B., Guo, C., Ma, Y., Jensen, C.S.: Toward personalized, context-aware routing. VLDB J. 24(2), 297–318 (2015)CrossRef
45.
Zurück zum Zitat Yang, B., Kaul, M., Jensen, C.S.: Using incomplete information for complete weight annotation of road networks. IEEE TKDE 26(5), 1267–1279 (2014) Yang, B., Kaul, M., Jensen, C.S.: Using incomplete information for complete weight annotation of road networks. IEEE TKDE 26(5), 1267–1279 (2014)
46.
47.
Zurück zum Zitat Yuan, J., Zheng, Y., Xie, X., Sun, G.: T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE TKDE 25(1), 220–232 (2013) Yuan, J., Zheng, Y., Xie, X., Sun, G.: T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE TKDE 25(1), 220–232 (2013)
48.
Zurück zum Zitat 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) 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.
Zurück zum Zitat 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) 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)
Metadaten
Titel
Fast stochastic routing under time-varying uncertainty
verfasst von
Simon Aagaard Pedersen
Bin Yang
Christian S. Jensen
Publikationsdatum
31.10.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
The VLDB Journal / Ausgabe 4/2020
Print ISSN: 1066-8888
Elektronische ISSN: 0949-877X
DOI
https://doi.org/10.1007/s00778-019-00585-6

Weitere Artikel der Ausgabe 4/2020

The VLDB Journal 4/2020 Zur Ausgabe

Premium Partner