A Label Correcting Algorithm for Dynamic Tourist Trip Planning

One of the most important considerations for tourist in tourism is how to design an optimal trip planning. Selecting the most interesting points of interest and designing a personalized tourist trip is called a tourist trip design problem (TTDP) and, it can be modeled as a orienteering problem. However, most previous researches solve this problem in static network, which leads to unreasonable results. In this paper, to formulate this orienteering problem in a time-dependent network, a mathematical programming model is built with introducing a time-aggregated graph. Then a novel label correcting algorithm (LCA) is presented to solve this problem based on the idea of network planning and dynamic programming. Finally, a numerical example is given to show the effectiveness and feasibility of the algorithm.