期刊文献+

基于改良圈算法与线性规划的全国自驾游线路优化研究 被引量:4

Research on the Optimization of National Self-driving Tour Route Based on Modified Circle Algorithm and Linear Programming
下载PDF
导出
摘要 自驾游以自由与个性化、灵活与舒适性等特点深受广大旅游爱好者喜爱,而其线路规划质量直接影响自驾游者的满意度。以全国5A级旅游景区为目的地,选取了一名西安市自驾游爱好者为研究对象,最初运用改良圈算法规划出各省份的游览线路,然后分别以时间最优和费用最优为目标函数,以年旅游时间限值、单次旅游时间限值为约束条件,建立了整数线性规划模型;采用LINGO软件,求解出一条全国5A级景区的自驾游最优方案,具有一定的适用性。 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 national5 A tourist attractions is solved with LINGO software,which has a certain applicability.
出处 《重庆工商大学学报(自然科学版)》 2016年第3期88-93,共6页 Journal of Chongqing Technology and Business University:Natural Science Edition
关键词 TSP问题 自驾游 线性规划 改良圈算法 LINGO TSP problem self-driving tour linear programming modified circle algorithm LINGO
  • 相关文献

参考文献6

二级参考文献16

  • 1龙斌.驾车自助游初探[J].桂林旅游高等专科学校学报,2004,15(4):35-39. 被引量:37
  • 2吉勒斯.运筹学导论-计算机算法[M].北京:机械工业出版社,1984..
  • 3[2]Christos H.Papadimitriou,Kenneth Steiglitz.COMBI-NATORIAL OPTIMIZATION:Algorithms and Complexity[M].Canada:General Publishing Company,1998.
  • 4[3]John E.Mitchell.Branch-and-Cut Algorithms for Combinatorial Optimization Problem[C].Mathematical Sciences,1999.
  • 5[4]M.Crǒtschel,O.Holland.Solution of large-scale traveling salesman problems[J].Mathematical Programming,1991,51(2):141-202.
  • 6[5]H.Crowder,M.W.Padberg.Solving large-scale symmetic travelling salesman problem to optimality[J].Manasement Science,1980(26):495-509.
  • 7[6]M.Padberg,G.Rinaldi.A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems[J].SIAM Review,1991,33(1):60-100
  • 8张海藩,面向对象的程序设计系统,1992年
  • 9吉勒斯,运筹学导论.计算机算法,1984年
  • 10王婉飞,董长云,翟涛.我国自驾车旅游发展现状及对策[N].中国旅游报,2005-02-02.

共引文献26

同被引文献39

引证文献4

二级引证文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部