Abstract
Abstract. When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.
Highlights
Traditional optimal travelling path of tourist scenic area is usually planned based on Graph Model [1]
From the definition 2, the double-weighted graph model of scenic spot can be seen as a complex graph, for its vertexes collection consists of entrances or exits belong to some scenic spot
Based on double-weighted graph model, this paper proposed algorithms for optimum path planning, which include methods both of building graph of scenic spot and path planning
Summary
Traditional optimal travelling path of tourist scenic area is usually planned based on Graph Model [1] These traditional algorithms map scenic spots (belong to some scenic area) into points of interests (POIs), and map road network links these POIs into line collection. When considering the inner connectivity among entrances or exits belong to scenic spot A, as shown in figure 1 (c), there would has a path L2 which is more practical and optimal between scenic spot A and B. It is obviously different between path L1 and path L2. The double-blind peer-review was conducted on the basis of the full paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
