Proposal on Edge Vector-based Formulation of Sightseeing Route Recommendation Problem and Its Solution with Simulated Annealing

Abstract

In the domain of tourism navigation, tourist spots as well as route visiting them are important information to be presented to tourists. However, it is difficult to determine tourist spots to visit and the route all at once. While an existing study has tried to solve such a tourism navigation problem by extending Traveling Salesman Problem (TSP) with introduction of weight for nodes (spots) assuming the shortest path as the trajectory between one spot and another spot, there is no study to consider the user’s preferences against routes according to those contents. This paper proposes the formulation of the tourism navigation problem, which assigns all factors needed for a solution to only edges. The solution using simulated annealing is also proposed.