江苏省5A级景区旅游路线规划  

5A Level Scenic Spot Tourism Route Planning of Jiangsu Province

作　　者：郑丽丽 欧启通[1] 

机构地区：[1]厦门理工学院,福建厦门

出　　处：《应用数学进展》2019年第5期1042-1050,共9页Advances in Applied Mathematics

基　　金：福建省大学生创新创业训练计划项目(项目编号:201811062076).

摘　　要：本文借助著名的旅行商(TSP)问题对江苏省23家5A级景区旅游路线进行动态规划。首先确定了景点和所在市之间的交通数据,构建高铁和公交车联合的复杂的交通线路网络,建立最短路径模型。然后利用蚁群算法对模型进行优化和求解,再根据结果对蚁群算法进行改进,得到满足条件的最短路径规划模型,得到了最佳的旅游路线。In this paper,the famous TSP problem is used to study the dynamic planning of tourism routes,a large number of literatures are referred in detail,and the data of 5A scenic spots in Jiangsu Prov-ince are collected and studied.The traffic data between the scenic spot and the city are determined,the complex traffic line network combined by high-speed rail and bus is constructed,and the shortest path model is established.At the same time,the ant colony algorithm is used to optimize and solve the model,and the ant colony algorithm is improved according to the results to obtain the shortest path planning model that meets the conditions,so as to provide route selection for more self-help travelers.

关 键 词：旅游路线规划 蚁群算法 TSP问题 动态规划问题 

分 类 号：F2[经济管理—国民经济]