RouteDOC: Routing with Distance, Origin and Category Constraints (Demonstration Paper)

Abstract

Route planning based on user’s preferences and Points of Interests (POIs) is one of the most popular applications of Location-Based Services (LBS). Variants of route planning consider distance constraints (e.g., the maximum length of the route), origin constraints (e.g., a set of possible starting locations of the route), and category constraints (e.g., a multiset of POI categories that the route must visit). However, the problem of deciding whether a route exists that visits all required POI categories under the distance constraint is known to be NP-hard. Assuming P ≠ NP, this means that there is no efficient (polynomial time) solution to find such paths. Recently, approximate algorithms have been proposed for searching for such a path. This demonstration leverages several of these algorithms to provide a web-based system with a graphical user interface (UI) which allows the users to find a path that: (a) satisfies a distance limit; (b) generates a route to visit a list of POIs, based on the user’s preferred categories; (c) provides a set of hotels (as possible starting locations of the path). If the approximate search algorithms are able to find such a path, it will be displayed on a Mapbox-based map interface that shows: (1) all POIs on a path and (2) alternative paths if any were found. The system then allows a user to explore the returned paths, select a path, or refine their constraints. Moreover, the system allows the users to select which approximate algorithm they would prefer to execute.