![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Location-based services and mobile computing: algorithms This paper considers a context- and user-aware approach to the tour planning in Geographic Information Systems. We regard the following scenario: a person with specific preferences and a fixed amount of time is visiting a foreign place of interest. Therefore spatial as well as user specific information is modeled as a multimodally attributed digraph structure, where nodes represent the points of interest and arcs the user optimal paths between them. The goal is to find a set of nodes and arcs representing a round trip that is best satisfying the priorities of the user. This results in an Enhanced Profitable Tour Problem (EPTP), which is - as a generalization of the well-known Traveling Salesman Problem (TSP) - an NP-hard optimization problem. In this article, we introduce an efficient algorithm for this problem and discuss the modeling and implementation details. ![]() DiSC'03 © 2003 Association for Computing Machinery |