A new optimisation model of the visitor routing problem applied to smart tourism

The visitor routing problem (VRP) is currently a major issue facing the tourism sector. The increasing flow of visitors demands efficient scheduling of their movement to ensure optimal visitor experience. In this paper, we propose a new mathematical programming model for managing tours for multiple groups of visitors based on their individual preferences. The proposed model takes into account various criteria such as distance, duration, budget, and risk factors. The well-known heuristic simulated annealing algorithm is well-suited to solve the proposed model. We applied the proposed routing model to a real-world problem related to the development of Fez City in Morocco. The experiments demonstrate that the proposed model offers numerous advantages for the development of the tourism sector.