基于动态优化的旅游线路设计研究

Research on tourism route design based on dynamic optimization

针对黄山市周边景区旅游线路的优化设计,通过分析现状及存在的问题,综合运用Dijkstra矩阵算法和线性规划,根据各景点的地理位置、门票价格、游玩时长等数据,分别建立了最短路回归模型和经费时间有限的规划问题模型,运用MATLAB,LINGO等软件编程求解,研究得出了12个热门景点间的最短距离,并得到了经费不超过2 000的三日游最佳线路。最后基于2个模型的结果,分别设计了春夏秋冬4种各具特色的旅游线路,旨在给游客带来最佳的用户体验。

The paper is aimed to the optimized design of tourist routes in the scenic spot of Huangshan City. At first, we analyze the status quo and existing problems, and then according to the location of the attractions, ticket prices, play time and other data, we use the Dijkstra matrix algorithm and linear programming to establish the shortest path regression model and the planning problem model with limited time. With the MATLAB, LINGO and other software programming solution, we figure out the conclusion that the shortest distance between 12 popular attractions, and the best three-day tour line which spend no more than 2000. Finally, in order to give visitors the best user experience, we have designed four kinds of season special tourist routes that based on the results of the two models.