Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications
From MaRDI portal
Publication:6159908
DOI10.4230/LIPICS.SEA.2021.18arXiv2103.10359OpenAlexW3164219999MaRDI QIDQ6159908FDOQ6159908
Authors: Valentin Buchhold, Dorothea Wagner 
Publication date: 23 June 2023
Abstract: Customizable contraction hierarchies are one of the most popular route planning frameworks in practice, due to their simplicity and versatility. In this work, we present a novel algorithm for finding k-nearest neighbors in customizable contraction hierarchies by systematically exploring the associated separator decomposition tree. Compared to previous bucket-based approaches, our algorithm requires much less target-dependent preprocessing effort. Moreover, we use our novel approach in two concrete applications. The first application are online k-closest point-of-interest queries, where the points of interest are only revealed at query time. We achieve query times of about 25 milliseconds on a continental road network, which is fast enough for interactive systems. The second application is travel demand generation. We show how to accelerate a recently introduced travel demand generator by a factor of more than 50 using our novel nearest-neighbor algorithm.
Full work available at URL: https://arxiv.org/abs/2103.10359
nearest neighborsradiation modelpoints of interestcustomizable contraction hierarchiestravel demand generation
This page was built for publication: Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159908)
