Optimal Sequenced Route Query Algorithm Using Visited POI Graph
نویسندگان
چکیده
The optimal sequenced route (OSR) query performs a critical role in finding the most economical route for a trip, for instance, location base services. OSR finds the minimum-length route, starting from an origin location and passing through a number of locations or points of interest (POIs), following the prespecified route sequence. An OSR query on road networks tends to expand an extremely large number of nodes, which leads to an increase in processing time. To reduce the number of node expansions, we propose a visited POI graph (VPG) to register a single found path that connects neighboring POIs. We also perform experiments to show the effectiveness of our method compared with an original approach, in terms of the number of expanded nodes and
منابع مشابه
Sequenced Route Query with Semantic Hierarchy
The trip planning query searches for preferred routes starting from a given point through multiple Point-of-Interests (PoI) that match user requirements. Although previous studies have investigated trip planning queries, they lack flexibility for finding routes because all of them output routes that strictly match user requirements. We study trip planning queries that output multiple routes in ...
متن کاملThe partial sequenced route query with traveling rules in road networks
In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial s...
متن کاملOptimal Path Queries in Very Large Spatial Databases
Researchers have been investigating the optimal route query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra’s shortest path algorithm is one of the most popular algorithms for the unconstrained route query proble...
متن کاملAdditively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries
The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a precomputation approach to OSR query in vector spaces. We exploit the geometric properties of the solution space and theoretically prove it...
متن کاملOptimal Route Query Based On Forward Search and Backward Search
Given a set of spatial points DS, each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., pub, restaurant, museum). The user may also specify partial order constraints between different categories, e.g., a r...
متن کامل