摘要
针对目前国内旅游线路的设计多偏向于从景区特色出发,而较少从旅行时间和路径入手的问题,利用贪婪算法设计数学模型。在旅行者不多于15天的旅行约束条件下,对国内201个5A风景区进行聚类分块,将201个景区简化为31个省市。算得从西安市出发到各省市的旅行时间并得到21条符合要求的旅行路线。将相关结果以更直观的图像形式展现,为旅行路线的设计研究提供了参考。
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.
出处
《电子科技》
2017年第9期142-145,共4页
Electronic Science and Technology
关键词
旅游线路
最优化问题
聚类贪婪算法
约束条件
tourist routes
optimization problem
clustering greedy algorithm
restrictions
