Top-k Sequenced Route Queries

Given a current point, a final destination, and visiting data point categories on a trip, a sequenced route query finds the shortest route which meets the query condition. Several algorithms have been proposed targeting to this query. When this query is used in real applications, the popularity of the visiting points (for example, restaurant, shopping center, etc.) in a trip are also important besides the length of the route. Therefore, a recommendation query method that evaluates the goodness by multiple criteria, such as the length and the popularity, is requested. This type of queries has been called Top-k query. This paper proposes a fast Top-k query method targeting to sequenced route queries.