Intelligent Targeted Tourism Route Planning Based on Internet

With the rapid development of the national economy, people's quality of life has also been greatly improved, and tourism has become a common hobby among people. With the popularization of the internet, new technologies and applications are becoming increasingly widespread, bringing great convenience to people's lives. This article improves the Dijkstra algorithm by directly selecting the next shortest path node from an unordered array or linked list, greatly saving computational time and effectively improving the execution efficiency of the algorithm. The function module of the Internet-based intelligent targeted tourism route planning system includes display of attraction information, recommendation of nearby attractions, itinerary planning, route display, and user management. Through experiments, it is found that when the path length is 400km, the success planning rate of Dijkstra algorithm is 83.5%, and the success planning rate of improved Dijkstra algorithm is <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{9 2. 5 \%}$</tex>. This article's method is helpful for the successful planning of tourism routes.