Shortest Path Algorithms: An Evaluation Using Real Road Networks

DOI10.1287/trsc.32.1.65zbMath0987.90514OpenAlexW2100586428WikidataQ56082322 ScholiaQ56082322MaRDI QIDQ2783796

Charles E. Noon, F. Benjamin Zhan

Publication date: 17 April 2002

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c71301816cfe1e0c7ed1a04fddd7740ceb2e8197

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (22)

A connectivity graph generation approach for Manhattan path calculation in detailed facility layout ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ Impact of the topology of urban streets on mobility optimization ⋮ Survey of robot 3D path planning algorithms ⋮ Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs ⋮ A novel approach for modeling order picking paths ⋮ Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems ⋮ New algorithms for multi objective shortest path problem. ⋮ Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics ⋮ Route planning with turn restrictions: A computational experiment ⋮ GNet: a generalized network model and its applications in qualitative spatial reasoning ⋮ A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem ⋮ The first \(K\) shortest unique-arc walks in a traffic-light network ⋮ Shortest-path queries in static networks ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ The multiple shortest path problem with path deconfliction ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ Multiple UAVs path planning algorithms: a comparative study

This page was built for publication: Shortest Path Algorithms: An Evaluation Using Real Road Networks