A Personalized Tourist Trip Design Algorithm For Mobile Tourist Guides

摘要

Mobile tourist guides evolve towards automated personalized tour planning devices. The contribution of this article is to put forward a combined artificial intelligence and melaheuristic approach to solve tourist trip design problems (TTDP). The approach enables fast decision support for tourists on small footprint mobile devices. The orienteering problem, which originates in the operational research literature, is used as a starting point for modelling the TTDP. The problem involves a set of possible locations having a score and the objective is to maximize the total score of the visited locations, while keeping the total time (or distance) below the available time budget. The score of a location represents the interest of a tourist in that location. Scores are calculated using the vector space model, which is a well-known technique from the field of information retrieval. The TTDP is solved using a guided local search metaheuristic. In order to compare the performance of this apjnoach with an algorithm that appeared in the literature, both are applied to a real data set from the city of Ghent. A collection of tourist points of interest with descriptions was indexed and subsequently queried with popular interests, which resulted in a test set of ITDPs. The approach presented in this article turns out to be faster and produces solutions of better quality.