A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A user-aware tour proposal framework using a hybrid optimization approach
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Selecting Problems for Algorithm Evaluation
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Energy-aware management for cluster-based sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Parallel implementation of a transportation network model
Journal of Parallel and Distributed Computing
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
A constrained road-based VR navigation technique for travelling in 3D city models
Proceedings of the 2005 international conference on Augmented tele-existence
Localization using discrete event simulation
WSC '04 Proceedings of the 36th conference on Winter simulation
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Evacuation route planning: scalable heuristics
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
GNet: A generalized network model and its applications in qualitative spatial reasoning
Information Sciences: an International Journal
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A shortest path algorithm with novel heuristics for dynamic transportation networks
International Journal of Geographical Information Science
Exact cell decomposition on base map features for optimal path finding
International Journal of Geographical Information Science
Multiple UAVs path planning algorithms: a comparative study
Fuzzy Optimization and Decision Making
Solving shortest path problem using particle swarm optimization
Applied Soft Computing
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Spatially modelling pathways of migratory birds for nature reserve site selection
International Journal of Geographical Information Science
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Computers and Operations Research
Ontology driven road network analysis based on analytical network process technique
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computers and Industrial Engineering
Finding shortest paths on real road networks: the case for A*
International Journal of Geographical Information Science
On A☆ search with stopover areas
International Journal of Geographical Information Science
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A statistical service composition approach based on hidden hierarchy Markov model
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
An efficient navigation algorithm of large scale distributed VRML/X3D environments
ICVR'07 Proceedings of the 2nd international conference on Virtual reality
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Three ITS path algorithms OpenMP parallel optimization on multi-core systems
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Memory-efficient A*-search using sparse embeddings
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Reasoning elements for a vehicle routing system
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
Norm convergence in populations of dynamically interacting agents
AICS'09 Proceedings of the 20th Irish conference on Artificial intelligence and cognitive science
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The influence of random interactions and decision heuristics on norm evolution in social networks
Computational & Mathematical Organization Theory
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
A shortest path algorithm based on limited search heuristics
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
An energy*delay efficient routing scheme for wireless sensor networks
MMNS'05 Proceedings of the 8th international conference on Management of Multimedia Networks and Services
An efficient shortest path computation system for real road networks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
The first K shortest unique-arc walks in a traffic-light network
Mathematical and Computer Modelling: An International Journal
Proceedings of the Winter Simulation Conference
A network transformation heuristic approach for the deviation flow refueling location model
Computers and Operations Research
Finding nearest neighbors in road networks: a tree decomposition method
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Tour suggestion for outdoor activities
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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 algorithms has been based on randomly generated networks, which may not have the characteristics of real road networks. In this paper, we provide an objective evaluation of 15 shortest path algorithms using a variety of real road networks. Based on the evaluation, a set of recommended algorithms for computing shortest paths on real road networks is identified. This evaluation should be particularly useful to researchers and practitioners in operations research, management science, transportation, and Geographic Information Systems.