运筹与管理2017，Vol.26Issue(9)：62-67,6.DOI:10.12005/orms.2017.0211
分块分层优化的旅游路线规划问题研究
Research on the Problem of the Tourism Route Planning By Optimization of Partitioning Block and Layer
摘要
Abstract
With the problem that route planning of tourism determines success or failure for travel of tourists by self-driving,the network optimization problem of tourism route planning was solved by using the idea of optimization of partitioning block and layer.The weighted graphs of partitioned network were constructed by using the idea of weighted graph and the nearest neighbor clustering algorithm to divide the scenic spots,and an improved TSP optimal model was established to plan the tourist routes of the scenic spot in the block for self-driving travel,which considers the travel time and driving time as well as visiting time during every time travel process.Then,an improved MTSP optimal model was established by treating each block as a note,treating the travel time of the block as one of the time weights,moreover tourist routes among blocks for self-driving travel were planned by using the simulated annealing algorithm.Next,the one-dimensional Bin Packing (BP)model to solve the minimum number of total tourism years was established through the idea of analogy one-dimensional Bin Packing problem,and whose minimum value was obtained by using cross filling algorithm.Finally,the optimal tourist routes that subjects to multiple constraints were planned for a travel enthusiast by self-driving in Xi'an City who travels through 201 5A level scenic spots in china with applying the proposed method in this thesis.关键词
网络优化/旅行商模型/一维装箱模型/模拟退火法/交叉装填算法Key words
network optimization/TSP model/one-dimensional packing model/simulated annealing method/cross filling algorithm分类
数理科学引用本文复制引用
钟仪华,罗仕明..分块分层优化的旅游路线规划问题研究[J].运筹与管理,2017,26(9):62-67,6.基金项目
四川省人民政府及四川省教育厅的项目“工学类硕士研究生数学课程体系与教学改革及试验(030039007)”和西南石油大学项目“最优化理论与控制”青年科研创新团队(2013XJZT004) （030039007）
