Introduction to algorithms
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
An improved network clustering method for I/O-efficient query processing
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
I/O-Efficiency of Shortest Path Algorithms: An Analysis
Proceedings of the Eighth International Conference on Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
FATES: Finding A Time dEpendent Shortest path
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Finding Fastest Paths on A Road Network with Speed Patterns
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Computing isochrones in multi-modal, schedule-based transport networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
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
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
ROSE: assisting pedestrians to find preferred events and comfortable public transport connections
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
On distributed time-dependent shortest paths over duty-cycled wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
T-drive: driving directions based on taxi trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
A Flexible Reservation Algorithm for Advance Network Provisioning
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Personalized tourist route generation
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Driving with knowledge from the physical world
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Calculating meeting points for multi user pedestrian navigation systems
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Discovering patterns in traffic sensor data
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on GeoStreaming
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hybrid approach for the public transportation time dependent orienteering problem with time windows
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Towards k-nearest neighbor search in time-dependent spatial network databases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Traffic aware route planning in dynamic road networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Integrating public transportation in personalised electronic tourist guides
Computers and Operations Research
Finding time period-based most frequent path in big trajectory data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Finding traffic-aware fastest paths in spatial networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Travel cost inference from sparse, spatio temporally correlated time series using Markov models
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
From taxi GPS traces to social and community dynamics: A survey
ACM Computing Surveys (CSUR)
Context-aware modelling of continuous location-dependent queries in indoor environments
Journal of Ambient Intelligence and Smart Environments - Context Awareness
| Hi-index | 0.00 |
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minimizes the total travel time from a place to another, over a road network, where the traffic conditions dynamically change from time to time. We study a generalized form of this problem, called the time-dependent shortest-path problem. A time-dependent graph GT is a graph that has an edge-delay function, wi, j(t), associated with each edge (vi, vj), to be stored in a database. The edge-delay function wi, j(t) specifies how much time it takes to travel from node vi to node vj, if it departs from vi at time t. A user-specified query is to ask the minimum-travel-time path, from a source node, vs, to a destination node, ve, over the time-dependent graph, GT, with the best departure time to be selected from a time interval T. We denote this user query as LTT(vs, ve, T) over GT. The challenge of this problem is the added complexity due to the time dependency in the time-dependent graph. That is, edge delays are not constants, and can vary from time to time. In this paper, we propose a novel algorithm to find the minimum-travel-time path with the best departure time for a LTT(vs, ve, T) query over a large graph GT. Our approach outperforms existing algorithms in terms of both time complexity in theory and efficiency in practice. We will discuss the design of our algorithm, together with its correctness and complexity. We conducted extensive experimental studies over large graphs and will report our findings.