Shortest paths in Euclidean graphs
Algorithmica
Shortest path algorithms: a computational study with the C programming language
Computers and Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Formal Language Constrained Path Problems
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Towards a Microscopic Traffic Simulation of All of Switzerland
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Towards Truly Agent-Based Traffic and Mobility Simulations
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Multiple UAVs path planning algorithms: a comparative study
Fuzzy Optimization and Decision Making
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
We carry out an experimental analysis of a number of shortest-path (routing) algorithms investigated in the context of the TRANSIMS (TRansportation ANalysis and SIMulation System) project. The main focus of the paper is to study how various heuristic as well as exact solutions and associated data structures affect the computational performance of the software developed for realistic transportation networks. For this purpose we have used a road network representing, with high degree of resolution, the Dallas Fort-Worth urban area.We discuss and experimentally analyze various one-to-one shortest-path algorithms. These include classical exact algorithms studied in the literature as well as heuristic solutions that are designed to take into account the geometric structure of the input instances.Computational results are provided to compare empirically the efficiency of various algorithms. Our studies indicate that a modified Dijkstra's algorithm is computationally fast and an excellent candidate for use in various transportation planning applications as well as ITS related technologies.