Time-Aggregated Graphs for Modeling Spatio-temporal Networks
Journal on Data Semantics XI
Ad hoc solution of the multicommodity-flow-over-time problem
IEEE Transactions on Intelligent Transportation Systems
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
A case for time-dependent shortest path computation in spatial networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
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
Time-Aggregated graphs for modeling spatio-temporal networks
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
| Hi-index | 0.00 |
We study the problem of computing minimum-cost paths through a time-varying network, in which the travel time and travel cost of each arc are known functions of one's departure time along the arc. For some problem instances, the ability to wait at nodes may allow for less costly paths through the network. When waiting is allowed, it is constrained by a (potentially time-varying) waiting policy that describes the length of time one may wait and the cost of waiting at every node. In discrete time, time-dependent shortest path problems with waiting constraints can be optimally solved by straightforward dynamic programming algorithms; however, for some waiting policies these algorithms can be computationally impractical. In this article, we survey several broad classes of waiting policies and show how techniques for speeding up dynamic programming can be effectively applied to obtain practical algorithms for these different problem variants. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(1), 41–46 2004