Efficient route search on hierarchical dynamic road networks
- 2 March 2014
- journal article
- Published by Springer Science and Business Media LLC in Distributed and Parallel Databases
- Vol. 33 (2), 227-252
- https://doi.org/10.1007/s10619-014-7146-x
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Traffic Aware Route Planning in Dynamic Road NetworksLecture Notes in Computer Science, 2012
- Performance analysis of a dual-tree algorithm for computing spatial distance histogramsThe VLDB Journal, 2010
- Finding shortest paths on real road networks: the case for A*International Journal of Geographical Information Science, 2009
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road NetworksPublished by Springer Science and Business Media LLC ,2008
- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s AlgorithmPublished by Springer Science and Business Media LLC ,2008
- A shortest path algorithm with novel heuristics for dynamic transportation networksInternational Journal of Geographical Information Science, 2007
- In Transit to Constant Time Shortest-Path Queries in Road NetworksPublished by Society for Industrial & Applied Mathematics (SIAM) ,2007
- On Trip Planning Queries in Spatial DatabasesLecture Notes in Computer Science, 2005
- Highway Hierarchies Hasten Exact Shortest Path QueriesLecture Notes in Computer Science, 2005
- Lifelong Planning A∗Artificial Intelligence, 2004