基于贪婪算法的旅游路线优化问题

›› 2017, Vol. 30 ›› Issue (9): 142-.

基于贪婪算法的旅游路线优化问题

滕泉 1，沈景凤 1，徐斌 2，王玮玮 3

(1.上海理工大学机械工程学院，上海200082;2上海材料研究所减振技术事业部，上海 200082；
3.大连海事大学交通运输管理学院，辽宁大连 116026)

出版日期:2017-09-15 发布日期:2017-11-03
作者简介:滕泉（1992-），男，硕士研究生。研究方向：CAE，精密测量。沈景凤（1968-），女，博士，副教授。研究方向：机械设计与理论等。

Tourism Route Optimization Based on Greedy Algorithm

TENG Quan 1，SHEN Jingfeng 1，XU Bin 2，WANG Weiwei 3

(1.School of Mechanical Engineering,University of Shanghai for Science and Technology,Shanghai 200082,China;
2.Damping Technology Department,Shanghai Research Institute of Materials,Shanghai 200082,China;
3.School of Transportation Management,Dalian Maritime University,Dalian 116026,China)

Online:2017-09-15 Published:2017-11-03

摘要/Abstract

摘要：

针对目前国内旅游线路的设计多偏向于从景区特色出发，而较少从旅行时间和路径入手的问题，利用贪婪算法设计数学模型。在旅行者不多于15天的旅行约束条件下，对国内201个5A风景区进行聚类分块，将201个景区简化为31个省市。算得从西安市出发到各省市的旅行时间并得到21条符合要求的旅行路线。将相关结果以更直观的图像形式展现，为旅行路线的设计研究提供了参考。

关键词: 旅游线路, 最优化问题, 聚类贪婪算法, 约束条件

Abstract:

In view of the present domestic tourist route design much favor from characteristics of scenic spots, and less from the travel time and path,Greedy algorithm is used to establish mathematical model.TIn the traveler not more than 15 days of travel constraints,201 domestic 5A scenic spots were clustered,and the 201 scenic spots will be reduced to 31 provinces and cities,Travel time is from xi an to various provinces and cities and get 21 conform to the requirements of the travel routes,The results are presented in a more intuitive image format,an innovative approach in the travel route design research.

Key words: tourist routes;optimization problem;clustering greedy algorithm;restrictions

中图分类号:

TP306.1

滕泉 1，沈景凤 1，徐斌 2，王玮玮 3. 基于贪婪算法的旅游路线优化问题[J]. , 2017, 30(9): 142-.

TENG Quan 1，SHEN Jingfeng 1，XU Bin 2，WANG Weiwei 3. Tourism Route Optimization Based on Greedy Algorithm[J]. , 2017, 30(9): 142-.