The Research Of Tourist Route On Optimization Design

Aiming at the design of tourist route in different practical problems, this paper uses graph theory and operations research methods to establish the shortest path problem, TSP problem, Programming problem, the maximum flow problem of touring itinerary optimization design model.The main problems and research methods are as follows:When given a tourist attraction, how to find between any two spots of the shortest path and the shortest distance, which make tourists travel more convenient. This article takes the Gansu province and the surrounding areas of tourist attractions as an example, It uses Dijkstra algorithm and Floyd algorithm to build the short-path problem of tourist route optimization design model. Beside,this article use Matlab programming to get any two spots between the shortest distance and the shortest route and way specified only two spots in the shortest route.When tourists selected tourist spots, they have to consider how to design starting from somewhere around all the attractions, after starting the tour circuit, so that tourists take the shortest distance. This article takes the country in all provinces (autonomous regions, municipalities directly under the central government) will, special administrative zone34areas as an example, using the modified circle algorithm based TSP tourist route optimization design model. and using Matlab programming, get around the shape of tourist routes, the optimal design of touring the country tour.According to the specific situations of tourism time and expenaiture, how to design a satisfied route as following mentioned:1) the tourist expenaiture is not restricted;2)tourists in visit the designed spots,making tourism the shortest tour;3)the tourists time is limited,make sure that tourists will travel as many as the sightseeing spots and routes;4) the costs of the tourism are also limited,so it’s also significant for tourists to travel as many tourist attractions as they can. This article take the Gansu province and the surrounding areas of tourist attractions as example, se we use LINGO preparation procedures to solve the model and establish a tourist route optimization design model, the results show this method is reasonable and practicable.According to the insider control problem of area flow, this paper uses the network maximum flow Ford-Fulkerson labeling algorithm to establish the maximum flow problem of tourist route optimization design model, and use Matlab programming, to design the tourist route that area flow maximum in the implementation of crowd control in the scenic spots.