Route planning; Predictive route planning; Time-dependent route planning; Time-dependent road networks; Traffic prediction
Definition
A combination of navigation services is currently being used to find the most optimal route that minimizes travel time on road networks. For example, online maps (e.g., Google Maps, Bing Maps) help us to determine the fastest path ahead of our journey. In-car GPS navigation and smartphone applications (e.g., Waze) calculate our path and update it during the drive using real-time traffic information. Our research shows that all these services have two main shortcomings in finding the optimal path. First, online map applications offer paths based on a snapshot of traffic that displays the best path if all conditions remain constant during the entire trip duration. Those that integrate real-time traffic, such as in-car GPS navigation systems and smartphone applications, can divert drivers based on unexpected congestion but with the same...
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 subscriptionsNotes
- 1.
The paths and their optimality are computed and verified by using edge travel times generated based on the 3 years of historical traffic sensor data collected from Los Angeles road network.
References
Batz GV, Delling D, Sanders P, Vetter C (2009) Time-dependent contraction hierarchies. In: ALENEX, New York
Delling D (2008) Time-dependent SHARC-routing. In: ESA, Karlsruhe
Delling D, Wagner D (2007) Landmark-based routing in dynamic graphs. In: WEA, Rome
Demiryurek U, Pan B, Banaei Kashani F, Shahabi C (2009) Towards modeling the traffic data on road networks. In: SIGSPATIAL-IWCTS, Seattle
Demiryurek U, Banaei Kashani F, Shahabi C (2010) A case for time-dependent shortest path computation in spatial networks. In: ACM SIGSPATIAL, San Jose
Demiryurek U, Banaei-Kashani F, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: SSTD, Minneapolis
Ding B, Xu Yu J, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT, Nantes
Dreyfus SE (1969) An appraisal of some shortest-path algorithms. Oper Res 17(3):395–412
Foschini L, Hershberger J, Suri S (2012) On the complexity of time-dependent shortest paths. Algorithmica 68(4):1075–1097
George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: SSTD, Boston
Goldberg AV, Harellson C (2005) Computing the shortest path: a search meets graph theory. In: SODA, Vancouver
Guc B, Ranganathan A (2010) Real-time, scalable route planning using stream-processing infrastructure. In: ITS
Jagadish HV, Gehrke J, Labrinidis A, Papakonstantinou Y, Patel JM, Ramakrishnan R, Shahabi C (2014) Big data and its technical challenges. Commun ACM 57(7):86–94
Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: ICDE. IEEE Computer Society, Washington, DC
Li F, Hadjieleftheriou M, Kollios G, Cheng D, Teng S-H (2008) Trip planning queries in road network databases. In: Shekhar S, Xiong H (eds) Encyclopedia of GIS. Springer, Boston, pp 1176–1181
Nannicini G, Delling D, Liberti L, Schultes D (2008) Bidirectional a* search for time-dependent fast paths. In: WEA, Provincetown
Pajor T, Delling D, Goldberg AV, Werneck RF (2011) Customizable route planning. In: SEA, Kolimpari
Pan B, Demiryurek U, Shahabi C (2012) Utilizing real-world transportation data for accurate traffic prediction. In: ICDM
Pan B, Demiryurek U, Shahabi C, Gupta C (2013) Forecasting spatiotemporal impact of traffic incidents on road networks. In: ICDM, Dallas
Pohl IS (1971) Bi-directional search. Mach Intell 6: 127–140
Potamias M, Bonchi F, Castillo C, Gionis A (2009) Fast shortest path distance estimation in large networks. In: CIKM, Hong Kong
Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: SIGMOD, Vancouver
Sanders P, Schultes D (2007) Engineering fast route planning algorithms. In: WEA, Rome
Wagner D, Willhalm T (2003) Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: ESA, Budapest
Zhang D (2008) Fastest-path computation. In: Shekhar S, Xiong H (eds) Encyclopedia of GIS. Springer, Boston, pp 309–313
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this entry
Cite this entry
Demiryurek, U., Shahabi, C. (2017). Predictive Path Planning. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1567
Download citation
DOI: https://doi.org/10.1007/978-3-319-17885-1_1567
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17884-4
Online ISBN: 978-3-319-17885-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering