Travel has became one of the most popular ways of modern lifestyle. This paper mainly discusses the route planning of travel all 5A scenic spots in the China. Firstly, We establish a mathematical model and transform the limited conditions include the scenic tour time, driving time, accommodation and other aspects to the mathematical formulas. Then, we introduce the relevant variables from the basic formula and draw the flow chart of the algorithm. In some places that densely-scenic spot, we use the "postman problem" to give the solution and specific analysis some places according to the specific conditions. Specifically, according to the seven regions of the country, we find the best path. In the same area, according to the specific circumstances such as the time and route of the integration, while considering the requirements of the subject like visit time and proportion of driving time, we plan to visit scenic spots one provine by province In order to improve the utilization rate of the time, we arrange the tour attractions in different regions in one year, let the vistor feel the difference between different areas of the landscape, fully enjoy the great rivers and mountains of the motherland, enhance the overall quality of tour.
[1]
Dominik Goeke,et al.
The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost
,
2013,
EURO J. Transp. Logist..
[2]
Yingcheng Xu,et al.
Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm
,
2013,
J. Appl. Math..
[3]
Christos D. Tarantilis,et al.
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
,
2008,
J. Heuristics.
[4]
Pierre Hansen,et al.
Variable Neighborhood Search
,
2018,
Handbook of Heuristics.
[5]
Dong Shao-hua,et al.
Multi-phase iterative heuristic approach for solving MDVRPTW
,
2007
.
[6]
Zhang Zhan-feng.
Transportation and Inventory Outsourcing Decision-makings of Fourth Party Logistics Based on Third Party Logistics Competition
,
2010
.