Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
Map-matching for low-sampling-rate GPS trajectories
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
| Hi-index | 0.00 |
When heading back home from work there are often things to do on the way like grocery shopping, getting cash from an ATM, refueling at a gas station, or dropping off a parcel at a post-office. We consider the problem of planning an optimal route (quickest or shortest) that visits facilities of the respective type on the way home. The proposed solution based on the combination of a distance sensitive doubling technique and contraction hierarchies is orders of magnitudes faster than either a naive approach or previous results and produces the answers in an instant for realistic queries without compromising guaranteed optimality. With such fast query times, this type of route query becomes feasible even on mobile devices or for high-throughput web-based route planners.