Shortest path algorithms: An evaluation using real road networks

DOI10.1287/TRSC.32.1.65MaRDI QIDQ2783796zbMATH OpenOpenAlexDBLPWikidataFDO

Authors F. Benjamin Zhan, Charles E. Noon

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

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

Cited in

(23)

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

This page was built for publication: Shortest path algorithms: An evaluation using real road networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783796)