Shortest Path Algorithms: An Evaluation Using Real Road Networks

  title={Shortest Path Algorithms: An Evaluation Using Real Road Networks},
  author={F. Benjamin Zhan and Charles E. Noon},
  journal={Transp. Sci.},
The classic problem of finding the shortest path over a network has been the target of many research efforts over the years. These research efforts have resulted in a number of different algorithms and a considerable amount of empirical findings with respect to performance. Unfortunately, prior research does not provide a clear direction for choosing an algorithm when one faces the problem of computing shortest paths on real road networks. Most of the computational testing on shortest path… 

Figures and Tables from this paper

The shortest path problem on large-scale real-road networks
An extensive computational study is presented, in which six existing algorithms and a new label correcting algorithm are implemented in several variants and compared on the real-road network of The Netherlands and the new algorithm has generally the shortest running times of any of the tested algorithms.
Finding shortest paths on real road networks: the case for A*
It is shown that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data.
An Improved A* Search Algorithm for Road Networks Using New Heuristic Estimation
A new heuristic function, called the k -step look-ahead, is incorporated into the A* search algorithm and a computational experiment is conducted to evaluate and compare the results on road networks of varying sizes.
Improvement of a Shortest Routes Algorithm
An original shortest path algorithm for graphs representing a real road network is described and the influence of a coefficient weighing the evaluated distance used in such short path algorithms is tested.
Practical algorithm for shortest path on transportation network
Experimental results on real dataset with 150 nodes and 176 edges, which is a subnet of the road-map in the Maryland State in US, show that the proposed algorithm reduce the calculations by about 8% on average in comparison to the traditional Dijkstra's algorithm.
An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks
This thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks, and finds that many different factors besides the network size affect the running time of an algorithm.
An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks
  • Jinfu Leng, W. Zeng
  • Computer Science
    2009 First International Conference on Information Science and Engineering
  • 2009
Experimental results show that the new algorithm overcomes the shortage of TWO-Q when the shortest path is relatively short and inherits the advantage of two-way shortest path algorithm when the longest path is comparatively long.
The Graph Growth Algorithm Implemented With Two Queues 5 . The Dijkstra ' s Algorithm Implemented With Approximate and Double Buckets
This paper reviews and summarizes a set of three shortest path algorithms, and demonstrates the data structures and procedures related to the algorithms.
Approximate shortest path and distance queries in networks
This thesis investigates the problem of efficiently computing exact and approximate shortest paths in graphs, with the main focus being on shortest path query processing and proves that exploiting well-connected nodes yields efficient distance oracles for scale-free graphs.
An Efficient Shortest Path Computation System for Real Road Networks
An efficient system to compute shortest paths in real road networks based on a two-level hierarchical network structure is developed and an algorithm to minimize the number of boundary nodes by relocating them between adjacent sub-networks is proposed.


A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
The study shows that the procedures examined indeed exert a powerful influence on solution efficiency, with the identity of the best dependent upon the topology of the network and the range of the arc distance coefficients.
A computational study of efficient shortest path algorithms
Computational study of an improved shortest path algorithm
A new hybrid solution algorithm called THRESH is presented, which integrates the features of label setting and label correcting algorithms, yet appears to have performance characteristics that transcend both.
Shortest paths algorithms: Theory and experimental evaluation
An extensive computational study of shortest paths algorithms, including some very recent algorithms, is conducted, based on several natural problem classes which identify strengths and weaknesses of various algorithms.
Implementation and efficiency of Moore-algorithms for the shortest route problem
  • U. Pape
  • Computer Science
    Math. Program.
  • 1974
The main objective of this paper is to show the strong relationship between an algorithm and its implementation and to show a variant of Moore's method seems to be most efficient for different types of graph structures.
Shortest path algorithms
Eight algorithms which solve the shortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies.
Network flows - theory, algorithms and applications
In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Shortest path algorithms: A computational study with the C programming language
Shortest-path methods: Complexity, interrelations and new propositions
A computational method which consists of determining shortest paths on a finite sequence of partial graphs defined as the “growth of the original graph” is developed and allowed to interpret within the same framework several different well-known algorithms.
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
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.