Probabilistic estimation of link travel times in dynamic road networks

Due to the availability of large historical and real-time traffic data, car navigation systems are becoming more and more advanced in predicting the travel time for various routes and finding the fastest route from a source to a destination given a start time. The most advanced of these systems predict the travel time of the routes, given past traffic patterns in order to find the best route. However, the best route is not necessarily a reliable route as well, i.e., the route with the least variation in possible travel times. The most reliable route is desirable when traveling with a deadline, e.g., to reach a flight at the airport or to arrive on time for an important meeting. To find the most reliable route, one needs to predict the probability distribution of travel times for that route. This in turn requires the estimation of travel time probability distributions for each and every link, given a link-entrance-time. In this paper we address the problem of computing these link travel time distributions. To the best of our knowledge there has not been any study on how to compute probability distributions for links (/edges) in road networks. We show how this first step can affect the accuracy of the travel time distribution over the entire route. Our final challenge is to evaluate the result of different approaches in computing these travel time distributions, which is difficult because the reported travel time is not a single value but a probabilistic distribution highly depending on the trip start time. We thus propose a statistical test that enables us to evaluate these outcomes.

[1]  Chetan Gupta,et al.  Forecasting Spatiotemporal Impact of Traffic Incidents on Road Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[2]  Jian Li,et al.  A unified approach to ranking in probabilistic databases , 2009, The VLDB Journal.

[3]  G. Brier.  VERIFICATION OF FORECASTS EXPRESSED IN TERMS OF PROBABILITY , 1950 .

[4]  Christian S. Jensen,et al.  Travel Cost Inference from Sparse, Spatio-Temporally Correlated Time Series Using Markov Models , 2013, Proc. VLDB Endow..

[5]  Ravi Seshadri,et al.  Algorithm for Determining Most Reliable Travel Time Path on Network with Normally Distributed and Correlated Link Travel Times , 2010 .

[6]  Mihaela van der Schaar,et al.  Mining the Situation: Spatiotemporal Traffic Prediction With Big Data , 2015, IEEE Journal of Selected Topics in Signal Processing.

[7]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[8]  Karl Pearson F.R.S..  X. On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling , 2009 .

[9]  Shiliang Sun,et al.  A bayesian network approach to traffic flow forecasting , 2006, IEEE Transactions on Intelligent Transportation Systems.

[10]  Y. Nie,et al.  Arriving-on-time problem : Discrete algorithm that ensures convergence , 2006 .

[11]  A. Raftery,et al.  Strictly Proper Scoring Rules, Prediction, and Estimation , 2007 .

[12]  Hans-Peter Kriegel,et al.  Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories , 2013, Proc. VLDB Endow..

[13]  Jignesh M. Patel,et al.  Big data and its technical challenges , 2014, CACM.

[14]  Jian Pei,et al.  Probabilistic path queries in road networks: traffic uncertainty aware path selection , 2010, EDBT '10.

[15]  Elise Miller-Hooks,et al.  Least possible time paths in stochastic, time-varying networks , 1998, Comput. Oper. Res..

[16]  Ugur Demiryurek,et al.  Utilizing Real-World Transportation Data for Accurate Traffic Prediction , 2012, 2012 IEEE 12th International Conference on Data Mining.

[17]  H. Hersbach.  Decomposition of the Continuous Ranked Probability Score for Ensemble Prediction Systems , 2000 .

[18]  Y. Nie,et al.  Shortest path problem considering on-time arrival probability , 2009 .

[19]  Mohamed A. Soliman,et al.  Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[20]  Farnoush Banaei Kashani,et al.  Online Computation of Fastest Path in Time-Dependent Spatial Networks , 2011, SSTD.

[21]  M. A. ShehnazBegum,et al.  T-Drive: Enhancing Driving Directions with Taxi Drivers' Intelligence , 2014 .

[22]  Edward Hung,et al.  Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.

[23]  Reynold Cheng,et al.  Uncertain Data Mining: An Example in Clustering Location Data , 2006, PAKDD.

[24]  E. R. Cohen.  An Introduction to Error Analysis: The Study of Uncertainties in Physical Measurements , 1998 .

[25]  Jeffrey Scott Vitter,et al.  Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data , 2004, VLDB.

[26]  Yufei Tao,et al.  Probabilistic Spatial Queries on Existentially Uncertain Data , 2005, SSTD.

[27]  J. Taylor.  An Introduction to Error Analysis , 1982 .

[28]  Peter J. Haas,et al.  MCDB: a monte carlo approach to managing uncertain data , 2008, SIGMOD Conference.

[29]  Karl Pearson,et al.  ON THE DISTRIBUTION OF THE CORRELATION COEFFICIENT IN SMALL SAMPLES. APPENDIX II TO THE PAPERS OF “STUDENT” AND R. A. FISHER. A COOPERATIVE STUDY , 1917 .

[30]  Qingquan Li,et al.  Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property , 2013, IEEE Transactions on Intelligent Transportation Systems.

[31]  Parag Agrawal,et al.  Trio: a system for data, uncertainty, and lineage , 2006, VLDB.

[32]  Dan Olteanu,et al.  Fast and Simple Relational Processing of Uncertain Data , 2007, 2008 IEEE 24th International Conference on Data Engineering.

[33]  P. Moschopoulos,et al.  The distribution of the sum of independent gamma random variables , 1985 .

[34]  Hani S. Mahmassani,et al.  Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks , 1999, Transp. Sci..

[35]  Hani S. Mahmassani,et al.  Impacts of Correlations on Reliable Shortest Path Finding , 2013 .

[36]  Karl Pearson,et al.  On the Distribution of the Correlation Coefficient in Small Samples. Appendix II to the Papers of "Student" and R. A. Fisher , 1917 .

[37]  Xing Wu,et al.  Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies , 2009 .

[38]  K. Pearson.  On the Criterion that a Given System of Deviations from the Probable in the Case of a Correlated System of Variables is Such that it Can be Reasonably Supposed to have Arisen from Random Sampling , 1900 .

[39]  Hans-Peter Kriegel,et al.  Querying Uncertain Spatio-Temporal Data , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[40]  J. Eric Bickel,et al.  Some Comparisons among Quadratic, Spherical, and Logarithmic Scoring Rules , 2007, Decis. Anal..

[41]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .

[42]  Hai Le Vu,et al.  Reliability in stochastic time-dependent traffic networks with correlated link travel times , 2012, 2012 15th International IEEE Conference on Intelligent Transportation Systems.