Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Computers and Operations Research
Network-tree model and shortest path algorithm
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
| Hi-index | 0.00 |
We propose a hierarchical algorithm for approximating shortest paths between all pairs of nodes in a large-scale network. The algorithm begins by extracting a high-level subnetwork of relatively long links (and their associated nodes) where routing decisions are most crucial. This high-level network partitions the shorter links and their nodes into a set of lower-level subnetworks. By fixing gateways within the high-level network for entering and exiting these subnetworks, a computational savings is achieved at the expense of optimality. We explore the magnitude of these tradeoffs between computational savings and associated errors both analytically and empirically with a case study of the Southeast Michigan traffic network. An order-of-magnitude drop in computation times was achieved with an on-line route guidance simulation, at the expense of less than 6% increase in expected trip times.