| 摘要: |
| 自驾游以自由与个性化、灵活与舒适性等特点深受广大旅游爱好者喜爱，而其线路规划质量直接影响自驾游者的满意度。以全国5A级旅游景区为目的地，选取了一名西安市自驾游爱好者为研究对象，最初运用改良圈算法规划出各省份的游览线路，然后分别以时间最优和费用最优为目标函数，以年旅游时间限值、单次旅游时间限值为约束条件，建立了整数线性规划模型；采用LINGO软件，求解出一条全国5A级景区的自驾游最优方案，具有一定的适用性。 |
| 关键词: TSP问题 自驾游 线性规划 改良圈算法 LINGO |
| DOI： |
| 分类号: |
| 基金项目: |
|
| Research on the Optimization of National Self driving Tour Route Based on Modified Circle Algorithm and Linear Programming |
|
XIE Fei1, YANG Yang1, HE Jie2
|
| Abstract: |
| Since the self driving has many advantages, such as liberalization, customization, flexibility and comfort, now many travel enthusiasts have been attracted by self driving. And the quality of the tourist routes may directly affect the satisfaction of self driving tourists. In this paper, the national 5A tourist attractions are taken as the destination, a self driving tourist in Xi’an City is selected as the research object. This article uses modified circle algorithm to design the tourist route of each province, sets the optimization of time and cost as objective function, takes the limit value of travel time per year and the limit value of single travel time as constraint condition, and builds the integer linear programming model. The optimal self driving tour decision of the national 5A tourist attractions is solved with LINGO software, which has a certain applicability. |
| Key words: TSP problem self driving tour linear programming modified circle algorithm LINGO |
