Taxi, Please! A Nearest Neighbor Query in Time-Dependent Road Networks

In this paper we propose a new kind of kNN query on time-dependent network, which aims at finding k points of interest that are closest in time to a query point. This query is useful for many kind of applications where a user/customer should ask for a service provided by many moving providers (e.g. Taxi drivers, ambulances, food delivers, etc). We described our solution and present experimental results comparing our proposed algorithm to a baseline approach. The experimental results show that our approach is efficient and effective.