Approximation algorithms for time-dependent orienteering
Information Processing Letters
Solving the Orienteering Problem Through Branch-And-Cut
INFORMS Journal on Computing
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Activity-based serendipitous recommendations with the Magitti mobile leisure guide
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
RouteCheckr: personalized multicriteria routing for mobility impaired pedestrians
Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility
Personalized tourist route generation
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Hybrid approach for the public transportation time dependent orienteering problem with time windows
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Integrating public transportation in personalised electronic tourist guides
Computers and Operations Research
Review: Mobile recommender systems in tourism
Journal of Network and Computer Applications
Hi-index | 0.01 |
In this paper, we describe ROSE (Routing Service), a mobile application which combines pedestrian navigation with event recommendation and live public transport support. It determines the best possible transport link and accompanies passengers throughout their entire journey. Our motivation is to free the passenger from as many tedious tasks as possible in finding an interesting event and on the way to it. Further, it reacts in real time to delays in the public transport system and calculates alternative routes when necessary. For route planning in this context, we will propose a two step algorithm for incorporating non monotone and non optimistic multi dimensional user preferences in an A*-like algorithm. We also present an assignment of theoretical foundations to real world route planning problems.