The shortest path problem on large-scale real-road networks

DOI10.1002/NET.20131zbMATH Open1148.90346OpenAlexW4248634500MaRDI QIDQ3418206FDOQ3418206

Authors: G. A. Klunder, H. N. Post 

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20131

Recommendations

• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
• Shortest path calculation in large road networks
• Microcomputer-based algorithms for large scale shortest path problems
• A memetic algorithm to schedule planned maintenance for the national grid
• Engineering Highway Hierarchies

zbMATH Keywords

shortest path problempreprocessingbidirectional searchlandmarksgraph reductionlabel settingheuristic estimatelabel correctingreal-road network

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold assignment algorithm
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Title not available (Why is that?)

Cited In (37)

• Routing algorithms with range restriction in sparse supply networks
• Algorithm engineering for route planning: an update
• Label-correcting shortest path algorithms revisisted
• Large margin shortest path routing
• Rule based shortest path query algorithm
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Title not available (Why is that?)
• Scalable exact visualization of isocontours in road networks via minimum-link paths
• Title not available (Why is that?)
• Combining speed-up techniques for shortest-path computations
• The searchlight problem for road networks
• Computing the nxm shortest path efficiently
• Acceleration of the A\(^*\)-algorithm for the shortest path problem in digital road maps
• A new bidirectional search algorithm with shortened postprocessing
• Dynamic graph generation for the shortest path problem in time expanded networks
• BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
• Estimation and determination of shortest path length in a road network with obstacles
• A Shortest Path Algorithm Based on Limited Search Heuristics
• Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
• Real-world applications of shortest path algorithms
• Title not available (Why is that?)
• An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
• Heuristic estimates in shortest path algorithms
• Theory and Applications of Models of Computation
• Geometric containers for efficient shortest-path computation
• An extension of labeling techniques for finding shortest path trees
• Fast paths in large-scale dynamic road networks
• Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
• Title not available (Why is that?)
• Ranking One Million Simple Paths in Road Networks
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
• A memetic algorithm to schedule planned maintenance for the national grid
• Title not available (Why is that?)
• Microcomputer-based algorithms for large scale shortest path problems
• An efficient algorithm for solving the median problem on real road networks
• The Shortcut Problem – Complexity and Approximation
• On a technique for finding running tracks of specific length in a road network

This page was built for publication: The shortest path problem on large-scale real-road networks

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