Application of a hybrid genetic algorithm based on the travelling salesman problem in rural tourism route planning

It is very meaningful to integrate tourism resources, excavate valuable tourism information and develop a self-service tourism route planning system. In this study, a hybrid genetic algorithm (HGA) based on the travelling salesman problem (TSP) is proposed, and the proposed algorithm is simulated and case-analysed. The research shows that the HGA algorithm has better optimisation efficiency when the number of iterations is less; when there are many urban attractions and large distances, the HGA algorithm will show more cross-routes. After multiple iterations, the optimisation effect and results of the algorithm will be better. There is still much room for improvement in the method proposed in this study. In the next step, map technology can be used to design more detailed route display functions.