Fast paths in large-scale dynamic road networks
TLDR
The heuristic solution method is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; it maintains a static highway hierarchy and performs each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network.Abstract:
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network. We provide computational results that show the efficacy of our approach.read more
Citations
More filters
Journal ArticleDOI
Analysis of travel times and CO2 emissions in time-dependent vehicle routing
TL;DR: A framework for modeling CO2 emissions in a time-dependent vehicle routing context is proposed and it is shown that limiting vehicle speeds is desired from a total cost perspective and that reducing emissions leads to reducing costs.
Book ChapterDOI
Engineering highway hierarchies
Peter Sanders,Dominik Schultes +1 more
TL;DR: An extensive revision of the shortest path algorithm that allows fast point-to-point queries in graphs using preprocessed data allows faster query and preprocessing times, it reduces the size of the data obtained during the preprocessing and it deals with directed graphs.
Book
Route Planning in Road Networks
TL;DR: This book addresses students, researchers, and software developers that are interested in car navigation systems, route planning services, logistics, or any other application where route planning in road networks plays a crucial role.
Journal ArticleDOI
Bidirectional A * search on time-dependent road networks
TL;DR: This work proposes a novel approach, which tackles one of the main complications of route planning in time‐dependent graphs, which is the difficulty of using bidirectional search: because the exact arrival time at the destination is unknown, it starts a backward search from the destination node using lower bounds on arc costs to restrict the set of nodes that have to be explored by the forward search.
Posted Content
A Survey of Shortest-Path Algorithms.
TL;DR: This survey studies and classifies shortest-path algorithms according to the proposed taxonomy and presents the challenges and proposed solutions associated with each category in the taxonomy.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
An Appraisal of Some Shortest-Path Algorithms
TL;DR: In this article, five discrete shortest-path problems are treated: finding the shortest path between two specified nodes of a network, determining the shortest paths between all pairs of nodes in a network; determining the second, third, etc., shortest path; 4 determining the fastest path through a network with travel times depending on the departure time; and 5 finding the short path between specified endpoints that passes through specified intermediate nodes.
Journal ArticleDOI
The physics of traffic
TL;DR: In this article, the authors discuss the effect of roadworks on the physics of traffic jams and show that traffic jams are a fact of life for many car drivers, who blame other drivers, increasing volumes of traffic and, inevitably, roadworks.
Journal ArticleDOI
The shortest route through a network with time-dependent internodal transit times
Kenneth L. Cooke,Eric Halsey +1 more
TL;DR: In this paper, a modified form of Bellman's iteration scheme for finding the shortest route between any two vertices in a network is developed for application to our generalized case, where internodal time requirements are time-variable and the main points of this treatment has been to arrange the work so that when computing a new iterate one does not have to recompute previous iterates at more advanced time points.
Journal ArticleDOI
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time:
TL;DR: A new and simple solution algorithm is proposed for all-to-one, all departure time intervals, shortest paths problems and it is proved, theoretically, that the new solution algorithm has an optimal run time complexity that equals the complexity of the problem.