A collaborative system for providing routes between locations

Abstract

Many systems, such as in-car GPS devices and airline company web sites, provide route information between locations. Although such systems are used widely and can provide route information successfully, users of these systems cannot contribute to the data entry process. In these systems, data is entered by the administrators and these systems cannot take advantage of the route expertise of their users. In this work, we present a collaborative system, which provides routes between locations upon user queries. The data in the system is entered by the users of the system. We present a model which is containing locations, links between locations and relationships between locations (containment, neighborhood and intersection) in order to store the data. For the route finding purpose, we present a customized version of the A* search algorithm. This customized version, named ACD (A for Collaborative Data), uses heuristics for estimating the cost remaining to the target location while processing the nodes. ACD can also provide alternative routes, exclude certain link types in the searches according to user preferences and handle the problems associated with multiple stop transportation lines. As the cost models, we use duration and financial cost. We also present the intuitive connections concept. Even if a route does not exist between the selected locations, the system can provide a route with missing links. The gap(s) between the disconnected locations are filled by the help of the relationships between locations. In order to evaluate the performance of the ACD algorithm, we present automated tests. These tests show that the costs of the routes that are provided by the A*CD algorithm are close to the actual shortest routes. In order to demonstrate the intuitive connections concept, we also present manual test queries.