Voronoi-based k-path nearest neighbor query in road networks

To satisfy the real-time requirement of k-path nearest neighbor (kPNN) query, the Voronoi-Based k-Path Nearest Neighbor (VBk-PNN) algorithm based on the pre-computed Voronoi-based Network Nearest Neighbor (VN³) is proposed in this paper. Depending on the pre-computation idea and using a di-Dijkstra´s algorithm search scheme to acquire the shortest path from the current location to destination, then, the nodes in the shortest path are got. At last, some nodes in same NVP as a set to search these nodes´ nearest neighbor, then these nodes´ nearest neighbors are optimized by a priority queue in order to get the correct kPNN. The performance of VBk-PNN is more efficient about kPNN query speed than Best-first Network Expansion (BNE).