An Optimal Travel Route Plan for Yangzhou Based on the Improved Floyd Algorithm

Abstract

Tourism industry is being recognized as one of the world's largest industries of revenue generation both in developed and developing countries. Since tourists may not be familiar with their destinations, an effective travel plan for tourism is important for gaining good user experiences during tourism. This paper addresses the issue of effective travel planning during tourism, and formulates the physical travel route problem as an all-to-all shortest path problem in graph. Furthermore, two improvements are proposed to the original Floyd-Warshall algorithm for reducing the computational complexities in finding the shortest travel route path. Finally, the significance of the proposed approach is demonstrated by illustrating an optimal travel route plan by deploying the proposed improved Floyd algorithm to find the shortest route among 12 scenic spots in the city of Yanzhou.