Sequenced route query in road network distance based on incremental Euclidean restriction

Abstract

This paper proposes a fast trip planning query method in the road network distance. The current position, the final destination, and some number of point of interest (POI) categories visited during the trip are specified in advance. Then, the query searches the shortest route from the current position with stops at one of each specified POI category from the visiting sequence before reaching the final destination. Several such types of trip planning methods have been proposed. Among them, this paper deals with the optimal sequenced route (OSR) which is the simplest query because it has a strongest restriction on the visiting order. This paper proposes a fast incremental algorithm to find OSR candidates in the Euclidean space. Furthermore, it provides an efficient verification method for the road network distance. © 2012 Springer-Verlag.