Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Time-Expanded Graphs for Flow-Dependent Transit Times
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Fastest Paths on A Road Network with Speed Patterns
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
Towards modeling the traffic data on road networks
Proceedings of the Second International Workshop on Computational Transportation Science
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
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
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A case for time-dependent shortest path computation in spatial networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient reachability query evaluation in large spatiotemporal contact datasets
Proceedings of the VLDB Endowment
A review of urban computing for mobile phone traces: current methods, challenges and opportunities
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
| Hi-index | 0.00 |
The problem of point-to-point fastest path computation in static spatial networks is extensively studied with many precomputation techniques proposed to speed-up the computation. Most of the existing approaches make the simplifying assumption that travel-times 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 on the edge. In this paper, we study the online computation of fastest path in time-dependent spatial networks and present a technique which speeds-up the path computation. We show that our fastest path computation based on a bidirectional time-dependent A* search significantly improves the computation time and storage complexity. With extensive experiments using real data-sets (including a variety of large spatial networks with real traffic data) we demonstrate the efficacy of our proposed techniques for online fastest path computation.