最短路径算法在旅游线路规划中的应用--以庐山为例

The application of the shortest path algorithm in the tourist route planning——With Mt.LuShan as an example

本文以庐山旅游风景区为例,以一日游为主题,结合旅游景区景点知名度和各景点的停留时间,改进了G IS中的最短路径算法,利用VC++分析旅游区内各个景点之间的最短路径关系,得出该旅游区内的三条较合理的不同主题的一日游路线。通过本文的研究,希望能加强对庐山风景区的开发力度,促进庐山风景区的发展,并最终能推广G IS在旅游线路规划中的应用。

In order to reasonably develop and plan the tourism resources of the tourist area, to meet the requirements of multi - level visitors, and to develop the tourism industry increasingly to information, network, and automation direction, this paper used Mr. LuShan as an example to improve the shortest path algorithm. With VC ＋ ＋ as a tool to analyze the shortest path relations of attractions, it got three different themes more reasonable Day trips line in the tourist area. Through this research, the author hoped to promote the development of Mr. Lushan, and finally to promote the application of tourist route planning with GIS.