A Critical-Time-Point Approach to All-Departure-Time Lagrangian Shortest Paths

IEEE Transactions on Knowledge and Data Engineering

Volumn 27, Issue 10, 2015, Pages 2591-2603

  Gunturi, Venkata M V ^a   Shekhar, Shashi ^a   Yang, Kwangsoo ^a  

^a University of Minnesota   (United States)

Author keywords

Road networks and Geographic Information Systems; Spatial databases

Indexed keywords

GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; LAGRANGE MULTIPLIERS; STRUCTURAL ANALYSIS;

BI-DIRECTIONAL SEARCH; COMPLETE INFORMATION; EXPERIMENTAL ANALYSIS; PARTIAL INFORMATION; REDUNDANT COMPUTATION; ROAD NETWORK; SPATIAL DATABASE; TERMINATION CONDITION;

TRANSPORTATION;

EID: 84941565533     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2426701     Document Type: Article

References (28)

1. Bing maps [Online]. Available: http://www.bing.com/maps/, Mar. 2015.
2. M. R. Evans, K. Yang, J. M. Kang, and S. Shekhar, "A Lagrangian approach for storage of spatio-temporal network datasets: A summary of results," in Proc. 18th SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2010, pp. 212-221.
3. L. A. Cruz, M. A. Nascimento, and J. A. F. de Macedo, "k-nearest neighbors queries in time-dependent road networks," J. Inf. Data Manag., vol. 3, no. 3, pp. 211-226, 2012.
4. U. Demiryurek, F. Banaei-Kashani, and C. Shahabi, "Efficient k-nearest neighbor search in time-dependent spatial networks," in Proc. 21st Intl. Conf. Database Expert Syst. Appl.: Part I, 2010, pp. 432-449.
5. U. Demiryurek, F. Kashani, and C. Shahabi, "A case for timedependent shortest path computation in spatial networks," in Proc. SIGSPATIAL Int. Conf. Adv. GIS, 2010, pp. 474-477.
6. J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y. Huang, "T-drive: driving directions based on taxi trajectories," in Proc. ACM 18th SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2010, pp. 99-108.
7. S. Shekhar, V. Gunturi, M. R. Evans, and K. Yang, "Spatial bigdata challenges intersecting mobility and cloud computing," in Proc. 11th ACM Int. Workshop Data Eng. Wireless Mobile Access, 2012, pp. 1-6.
8. B. Ding, J. X. Yu, and L. Qin, "Finding time-dependent shortest paths over large graphs," in Proc. Int. Conf. Extending Database Technol., 2008, pp. 205-216.
9. E. Kanoulas, Y. Du, T. Xia, and D. Zhang, "Finding fastest paths on a road network with speed patterns," in Proc. 22nd Int. Conf. Data Eng., 2006, p. 10.
10. U. Demiryurek, F. Banaei-Kashani, C. Shahabi, and A. Ranganathan, "Online computation of fastest path in timedependent spatial networks," in Proc. 12th Int. Conf. Adv. Spatial Temporal Databases, 2011, pp. 92-111.
11. V. M. V. Gunturi, E. Nunes, K. Yang, and S. Shekhar, "A criticaltime-point approach to all-start-time lagrangian shortest paths: A summary of results," in Proc. 12th Int. Conf. Adv. Spatial Temporal Databases, 2011, pp. 74-91.
12. B. George and S. Shekhar, "Time-Aggregated graphs for modelling spatio-temporal networks," J. Semantics Data, vol. XI, p. 191, 2007.
13. B. George, S. Kim, and S. Shekhar, "Spatio-temporal network databases and routing algorithms: A summary of results," in Proc. Symp. Spatial Temporal Databases, 2007, pp. 460-477.
14. G. Batchelor, An Introduction to Fluid Dynamics. Cambridge, U.K.: Cambridge Univ. Press, 1973.
15. G. Nannicini, D. Delling, D. Schultes, and L. Liberti, "Bidirectional asearch on time-dependent road networks," Networks, vol. 59, no. 2, pp. 240-251, 2012.
16. G. Nannicini, D. Delling, L. Liberti, and D. Schultes, "Bidirectional asearch for time-dependent fast paths," in Experimental Algorithms. Berlin, Germany: Springer, 2008, pp. 334-346.
17. D. Delling and G. Nannicini, "Bidirectional core-based routing in dynamic time-dependent road networks," in Proc. 19th Int. Symp. Algorithms Computation, 2008, pp. 812-823.
18. G. Nannicini, "Point-to-point shortest paths on dynamic timedependent road networks," 4OR, vol. 8, no. 3, pp. 327-330, 2010.
19. L. Foschini, J. Hershberger, and S. Suri, "On the complexity of time-dependent shortest paths," in Proc. 22nd Annu. ACM-SIAM Symp. Discrete Algorithms, 2011, pp. 327-341.
20. Navteq [Online]. Available: https://company.here.com/here/, Mar. 2015.
21. Openstreetmap [Online]. Available: http://www.openstreetmap. org/, Mar. 2015.
22. D. Delling and D. Wagner, "Landmark-based routing in dynamic graphs," in Experimental Algorithms. Berlin, Germnay: Springer, 2007, pp. 52-65.
23. D. Delling, "Time-dependent SHARC-routing," in Proc. 16th Annu. Eur. Symp. Algorithms, 2008, pp. 332-343.
24. D. Delling and D. Wagner, "Time-dependent route planning," in Robust and Online Large-Scale Optimization. Berlin, Germany: Springer, 2009, pp. 207-230.
25. I. Chabini and S. Lan, "Adaptations of the aalgorithm for the computation of fastest paths in deterministic discrete-time dynamic networks," IEEE Trans. Intell. Transp. Syst., vol. 3, no. 1, pp. 60-74, Mar. 2002.
26. E. Khler, K. Langkau, and M. Skutella, "Time-expanded graphs for flow-dependent transit times," in Proc. 10th Annu. Eur. Symp. Algorithms, 2002, vol. 2461, pp. 49-56.
27. A. Orda and R. Rom, "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length," J. ACM, vol. 37, no. 3, pp. 607-625, Jul. 1990.
28. D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck, "Phast: Hardware-Accelerated shortest path trees," J. Parallel Distrib. Comput., vol. 73, no. 7, pp. 940-952, 2013.