Developing a context-aware electronic tourist guide: some issues and experiences
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
A Personalized Tourist Trip Design Algorithm For Mobile Tourist Guides
Applied Artificial Intelligence
Ontology based personalized route planning system using a multi-criteria decision making approach
Expert Systems with Applications: An International Journal
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
A Mobile Tourist Decision Support System for Small Footprint Devices
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
International Journal of Applied Mathematics and Computer Science
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Tourist trip planning functionalities: state-of-the-art and future
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
The present article introduces the outdoor activity tour suggestion problem (OATSP). This problem involves finding a closed path of maximal attractiveness in a transportation network graph, given a target path length and tolerance. Total path attractiveness is evaluated as the sum of the average arc attractiveness and the sum of the vertex prizes in the path. This problem definition takes its rise in the design of an interactive web application, which suggests closed paths for several outdoor activity routing modi, such as mountain biking. Both path length and starting point are specified by the user. The inclusion of POIs of some given types enrich the suggested outdoor activity experience. A fast method for the generation of heuristic solutions to the OATSP is presented. It is based on spatial filtering, the evaluation of triangles in a simplified search space and shortest path calculation. It generates valuable suggestions in the context of a web application. It is a promising method to generate candidate paths used by any local search algorithm, which further optimizes the solution.