A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Cyberguide: a mobile context-aware tour guide
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Developing a context-aware electronic tourist guide: some issues and experiences
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Intelligent Systems for Tourism
IEEE Intelligent Systems
SmartKom mobile: intelligent ubiquitous user interaction
Proceedings of the 9th international conference on Intelligent user interfaces
Interactive assistance for tour planning
SC'10 Proceedings of the 7th international conference on Spatial cognition
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
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.