基于改进蚁群算法对嘉兴文旅路线的设计  

Design of Jiaxing Cultural Travel Route Based on Improved Ant Colony Algorithm

作　　者：李苏默 李雨柔 朱银禹 谢佳硕 张俊 Li Sumo;Li Yurou;Zhu Yinyu;Xie Jiashuo;Zhang Jun(Jiaxing Nanhu University,Jiaxing,China)

机构地区：[1]嘉兴南湖学院,浙江嘉兴

出　　处：《科学技术创新》2025年第8期64-67,共4页Scientific and Technological Innovation

摘　　要：随着国家红色文旅融合发展的推动,国民选择红色文旅的积极性不断提高。本文以浙江嘉兴地区为例,拟设计一条游遍嘉兴五县两区27个景点的最短旅游路线,其实质是一个组合优化的旅行商问题。本文以“老火车站”为起终点,利用2-opt局部搜索对普通蚁群算法寻找的最佳路径进行局部替换比较,用改进前后的算法分别对选取的景点进行路线设计验证。结果表明:经过2-opt局部搜索改进的蚁群算法设计路线距离为316.3 km,未改进的算法路线距离为319.4 km,优化了3.1 km,且通过可视化发现传统蚁群算法局部最优解的问题经改进后得到解决。With the promotion of the integration and development of national red cultural and tourism,the enthusiasm of the people to choose red cultural and tourism continues to increase.Taking Jiaxing area of Zhejiang Province as an example,this paper intends to design a shortest travel route through 27 scenic spots in five counties and two districts of Jiaxing,which is essentially a combination optimization of travel salesman problem.Taking"old railway station"as the starting and ending point,this paper uses 2-opt local search to make local replacement comparison of the best route found by the ordinary ant colony algorithm,and verifies the route design of the selected scenic spots with the algorithm before and after the improvement.The results show that the route distance of the improved ant colony algorithm with 2-opt local search is 316.3 km,and the route distance of the unimproved algorithm is 319.4 km,which is an optimization of 3.1 km.Moreover,the problem of the local optimal solution of the traditional ant colony algorithm is found by visualization and solved after improvement.

关 键 词：文旅路线 旅行商问题 蚁群算法 2-opt局部搜索 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP391.4[自动化与计算机技术—控制科学与工程]