Nearest neighbor queries with service time constraints in time-dependent road networks

Authors:
Camila F. Costa;Mario A. Nascimento;José A. F. Macêdo;Javam de C. Machado
Affiliations:
Federal University of Ceará, Brazil;University of Alberta, Canada;Federal University of Ceará, Brazil;Federal University of Ceará, Brazil
Venue:
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Year:
2013

Citing 7
Cited 0

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries

Proceedings of the 27th International Conference on Very Large Data Bases
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient k-nearest neighbor search in time-dependent spatial networks

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Towards k-nearest neighbor search in time-dependent spatial network databases

DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding the closest point of interest in road networks where the travel time along each edge is a function of the departure time and the service time of the facilities are taken into consideration. More specifically, our query aims to find the point of interest (e.g., a museum) in which the user can be served in the minimum amount of time, accounting for both the travel time to the point of interest and the waiting time, if it is closed. We discuss our proposed solution and present experimental results comparing the quality of the response returned by our proposed algorithm to an approach where possible waiting times are not considered.