成都市内旅游路线规划研究——基于SA、GA算法  

Research on the Planning of Tourist Routes in Chengdu:Based on SA,GA

作　　者：李敏 朱南[2] 李明辉 LI Min;ZHU Nan;LI Ming-hui(Hubei Engineering University,Xiaogan 432000,China;Southwestern University of Finance and Economics,Chengdu 610074,China;Wuhan Huaxia University of Technology,Wuhan 430223,China)

机构地区：[1]湖北工程学院,孝感432000 [2]西南财经大学,成都610074 [3]武汉华夏理工学院,武汉430223

出　　处：《价值工程》2022年第28期38-40,共3页Value Engineering

摘　　要：研究旅游路线的规划问题,为游客设立合理的游览线路,不仅可以达到耗时最少、线路最短进而提升游客的体验感的目的,而且可以促进我国旅游业蓬勃发展。以省会成都为中心,选取成都市内12个旅游景点以及查寻各个景点的经纬度,用Python进行模拟退火算法及遗传算法运算,构建省内游览路线的哈密顿圈,制定一套可以有效实施的成都市内景区的最佳路线规划方案。To study the planning of tourism routes and setting up reasonable tour routes for tourists can not only achieve the purpose of least time-consuming,shortest routes and improving the experience of tourists,but also promote the vigorous development of China's tourism industry.Taking Chengdu,the provincial capital,as the center,select 12 tourist attractions in Chengdu and search for the longitude and latitude of each scenic spot,using Python to conduct Floyd,Simulated Annealing and Genetic Algorithm,to construct the Hamiltonian circle of tourist routes in the province that develops a set of effective implementation of the best route planning scheme of Chengdu scenic spots.

关 键 词：最短路径 哈密顿圈 模拟退火算法 遗传算法 

分 类 号：F592.7[经济管理—旅游管理]