Dynamic Optimal Route Selection Of Urban Suburb Tourism

In recent years,with the continuous improvement of people's living standards and the widespread popularity of private cars,the demand for urban residents to choose to drive to the suburbs of the city in their leisure time for holiday travel is growing,tourists can choose their own destinations according to their individual needs.They can also flexibly choose traffic routes and scenic spots tour order according to road traffic status and scenic spot passenger flow information.How to use real-time information of roads and scenic spots to dynamically select the optimal tourism path to avoid travel congestion and scenic spots arrangement have become the primary problem of suburban tourism.This paper puts forward a method of choosing dynamic tourism routes in urban suburbs based on the shortest travel distance and the best travel time,which is of great significance to improve the comfort of tourists and reduce travel delays.Firstly,in order to describe the whole travel process of tourists,according to the time and space scope of urban suburban tourism,this paper analyses the travel characteristics of urban suburban tourism and the influencing factors of travel path,and abstracts the elements of tourism path such as tourist attractions and traffic routes into a complete linear structure,which is used to describe the space-time relationship of the whole tourism process.Secondly,aiming at the shortest travel path problem,Dijkstra algorithm is used to solve the shortest path between two scenic spots.According to the length of the shortest path between the two scenic spots,using the idea of solving the traveling salesman problem,the travel order of the shortest travel path is continuously found from the combination of all travel orders through genetic algorithm.This paper optimizes the tour sequence of scenic spots with the shortest travel distance from the starting point to the starting point and temporarily changing scenic spots.Combining the shortest path between the two scenic spots,the shortest travel distance is obtained.Finally,for the travel dynamic path problem of travel time optimization,according to historical data,the travel time of roads and scenic spots in different periods are predicted,and the shortest path of travel time between two scenic spots is dynamically searched by using the search mechanism based on time window.Because any kind of tour order can calculate the travel time by using the search mechanism based on time window,the travel order of the shortest travel time path is continuously found out from the combination of all tour orders by genetic algorithm.In this paper,the shortest travel time scenic spots are optimized under three conditions: starting from the beginning to return to the starting point,temporarily changing scenic spots and specifying lunch places.Combining the shortest travel time path between the two scenic spots,the shortest travel time path is obtained.The example shows that the dynamic path selection method proposed in this paper has more advantages than the static path selection method.