旅游路线规划问题

Tourism Route Planning Problem

对旅游爱好者游遍201个5A级景点的旅行方案进行研究.首先,建立以总的旅游时间达到最小的0-1数学规划模型,利用枚举法将景点划分成若干类,并将其视为TSP问题,用蚁群算法得出常住地为西安的旅游者游遍所有景点至少需要的时间和最优路线;其次,考虑了费用最小,旅游体验最好的因素,建立多目标规划模型,通过模糊隶属度函数的构造,将多目标规划模型进行线性加权组合转化为单目标规划问题进行求解.还引入TOPSIS模型,对常住地在北京的自驾游爱好者提供了一个简要版旅游计划.最后,用因子分析和灰关联分析相结合的方法遴选了相应5A级和4A级旅游景区,并给出该旅游爱好者合理的十年旅游规划.

The tourists’ travel plan for traveling around 201 view spots in 5A is studied.Firstly,we establish a mathematical programming model with 0-1 variables to minimize the total travel time,and apply enumeration method to classify these view spots as a TSP problem,and we can get the optimal route and the shortest time with the ant colony algorithm for the tourists living in Xi’an.Considering the factors of the least cost and the best tourism experience,we construct multi-objective programming model,which is converted into single objective programming model to get its solution by introducing fuzzy membership function and linear weighted combination of multi-objectives.TOPSIS model is built to provide a brief version of the travel plan for tourists living in Beijing.Finally,some 5A and 4A view spots are selected according to combined analysis of factor analysis and grey relational analysis,and a decade travel plan is given more reasonably.