The Community for Technology Leaders
RSS Icon
Atlanta, GA, USA
April 3, 2006 to April 7, 2006
ISBN: 0-7695-2570-9
pp: 10
Evangelos Kanoulas , Northeastern University
Yang Du , Northeastern University
Tian Xia , Northeastern University
Donghui Zhang , Northeastern University
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should find a partitioning of I into sub-intervals. Existing methods can only be used to solve a very special case of the problem, when the leaving time is a single time instant. A straightforward solution to the allFP query is to run existing methods many times, once for every time instant in I. This paper proposes a solution based on novel extensions to the A* algorithm. Instead of expanding the network many times, we expand once. The travel time on a path is kept as a function of leaving time. Methods to combine travel-time functions are provided to expand a path. A novel lower-bound estimator for travel time is proposed. Performance results reveal that our method is more efficient and more accurate than the discrete-time approach.
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zhang, "Finding Fastest Paths on A Road Network with Speed Patterns", ICDE, 2006, 22nd International Conference on Data Engineering, 22nd International Conference on Data Engineering 2006, pp. 10, doi:10.1109/ICDE.2006.71
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool