Efficient Fastest-Path Computations in Road Maps

10/02/2018
by   Renjie Chen, et al.
8

In the age of real-time online traffic information and GPS-enabled devices, fastest-path computations between two points in a road network modeled as a directed graph, where each directed edge is weighted by a "travel time" value, are becoming a standard feature of many navigation-related applications. To support this, very efficient computation of these paths in very large road networks is critical. Fastest paths may be computed as minimal-cost paths in a weighted directed graph, but traditional minimal-cost path algorithms based on variants of the classic Dijkstra algorithm do not scale well, as in the worst case they may traverse the entire graph. A common improvement, which can dramatically reduce the number of traversed graph vertices, is the A* algorithm, which requires a good heuristic lower bound on the minimal cost. We introduce a simple, but very effective, heuristic function based on a small number of values assigned to each graph vertex. The values are based on graph separators and computed efficiently in a preprocessing stage. We present experimental results demonstrating that our heuristic provides estimates of the minimal cost which are superior to those of other heuristics. Our experiments show that when used in the A* algorithm, this heuristic can reduce the number of vertices traversed by an order of magnitude compared to other heuristics.

READ FULL TEXT

page 6

page 9

page 13

page 14

page 15

page 16

research
12/18/2018

A Scalable Heuristic for Fastest-Path Computation on Very Large Road Maps

Fastest-path queries between two points in a very large road map is an i...
research
01/08/2019

Faster parameterized algorithm for pumpkin vertex deletion set

A directed graph G is called a pumpkin if G is a union of induced paths ...
research
12/26/2018

Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem

All traditional methods of computing shortest paths depend upon edge-rel...
research
04/25/2023

Towards Generating Hop-constrained s-t Simple Path Graphs

Graphs have been widely used in real-world applications, in which invest...
research
09/03/2021

Finding Colorful Paths in Temporal Graphs

The problem of finding paths in temporal graphs has been recently consid...
research
05/30/2023

Optimal energetic paths for electric cars

A weighted directed graph G=(V,A,c), where A⊆ V× V and c:A→ R, describes...
research
08/03/2022

A Multi-Threading Algorithm for Constrained Path Optimization Problem on Road Networks

The constrained path optimization (CPO) problem takes the following inpu...

Please sign up or login with your details

Forgot password? Click here to reset