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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.