基于优化旅行商算法的旅游自驾路径设计  

Design of tourism self driving path based on optimized traveling salesman algorithm

作　　者：邵一萌 SHAO Yimeng(Xi'an Mingde Institute of Technology,Xi'an 710065,China)

机构地区：[1]西安明德理工学院,西安710065

出　　处：《计算机应用文摘》2024年第13期47-49,共3页Chinese Journal of Computer Application

摘　　要：随着自驾旅游的日益普及,如何设计出既满足游客需求又尽可能减少行驶距离的旅游路线变得尤为重要。文章将旅行商算法作为规划路径的基本算法,为需要规划的自驾路径添加了约束条件与限界函数,对基本算法进行了优化。With the increasing popularity of self driving tourism,it has become particularly important to design tourist routes that meet the needs of tourists while minimizing the distance traveled.The article takes the traveling salesman algorithm as the basic algorithm for path planning,adds constraints and limit functions to the self driving path that needs to be planned,and optimizes the basic algorithm.

关 键 词：旅行商问题 优化算法 自驾旅游 路径设计 路线规划 

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