Tourism Route Design and Optimization Based on Heuristic Algorithm

This paper focuses on the model and algorithm for optimization of tourist routes. For the optimization problem of "multi-day tourism" it proposes a novel strategy based on heuristic algorithm. It adopts Monte Carlo improved simulated annealing algorithm, to provide optimized design of local tourist route in a certain area, with the object of shortest path and smallest cost. It also establishes the mathematical model of "multi-day" tourism route. By multiple experiments and computation, it is founded that the application of simulated annealing in tourism route design can effectively acquire the optimal solution or approximate optimal solution. Finally the tourist attractions of a certain city is taken as an example to verify the method proposed in this paper.