A case for time-dependent shortest path computation in spatial networks

Authors:
Ugur Demiryurek;Farnoush Banaei-Kashani;Cyrus Shahabi
Affiliations:
University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA
Venue:
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Year:
2010

Citing 9
Cited 3

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Algorithms for minimum-cost paths in time-dependent networks with waiting policies

Networks
Finding Fastest Paths on A Road Network with Speed Patterns

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Time-Dependent SHARC-Routing

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Towards modeling the traffic data on road networks

Proceedings of the Second International Workshop on Computational Transportation Science
Engineering fast route planning algorithms

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms

A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Online computation of fastest path in time-dependent spatial networks

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Proximity queries in time-dependent traffic networks using graph embeddings

Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing approaches make the simplifying assumption that weights (e.g., travel-time) of the network edges are constant. However, with real-world spatial networks the edge travel-times are time-dependent, where the arrival-time to an edge determines the actual travel-time of the edge. With this paper, we study the applicability of existing shortest path algorithms to real-world large time-dependent spatial networks. In addition, we evaluate the importance of considering time-dependent edge travel-times for route planning in spatial networks. We show that time-dependent shortest path computation can reduce the travel-time by 36% on average as compared to the static shortest path computation that assumes constant edge travel-times.