An a* algorithm framework for the point-to-point time-dependent shortest path problem

Authors:
Tatsuya Ohshima;Pipaporn Eumthurapojn;Liang Zhao;Hiroshi Nagamochi
Affiliations:
JFE Steel Corporation, Kurashiki, Japan;Graduate School of Informatics, Kyoto University, Japan;Graduate School of Informatics, Kyoto University, Japan;Graduate School of Informatics, Kyoto University, Japan
Venue:
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Year:
2010

Citing 8
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
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
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Bidirectional A* search for time-dependent fast paths

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a directed graph, a nonnegative transit-time function ce(t) for each edge e (where t denotes departure time at the tail of e), a source vertex s, a destination vertex d and a departure time t0, the point-to-point time-dependent shortest path problem (TDSPP) asks to find an s,d-path that leaves s at time t0 and minimizes the arrival time at d. This formulation generalizes the classical shortest path problem in which ce are all constants. This paper presents a novel generalized A* algorithm framework by introducing time-dependent estimator functions. This framework generalizes previous proposals that work with static estimator functions. We provide sufficient conditions on the time-dependent estimator functions for the correctness. As an application, we design a practical algorithm which generalizes the ALT algorithm for the classical problem (Goldberg and Harrelson, SODA05). Finally experimental results on several road networks are shown.