Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Speeding Up Dynamic Shortest-Path Algorithms
INFORMS Journal on Computing
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
IEEE Transactions on Intelligent Transportation Systems
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Multi-agent system for parallel road network hierarchization
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network, using a simple algorithm to propagate available dynamic traffic information over a larger part of the road network. We provide computational results that show the efficacy of our approach.