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.
| Published in | American Journal of Applied Mathematics (Volume 4, Issue 4) |
| DOI | 10.11648/j.ajam.20160404.15 |
| Page(s) | 192-196 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2016. Published by Science Publishing Group |
Optimal Path Planning, Multiple Time Windows, Chinese Postman Problem
| [1] | Jun Zhang. Model and Algorithm for the Multi DePot Vehiele Routing Problem with Time Windows [D]. dalian: Dalian University of Technology, 2010. |
| [2] | Peng Hui. Introduction of psychological variables in travel choice behave or model of medium and remote passengers [J]. Journal of Chang'an University, 306-312. |
| [3] | Hong Lianxi. Multi-phase iterative heuristic approach for solving MDVRPTW [J]. Computer Engineering and Applications, 2007, 43 (26): 217-222. |
| [4] | Mladenovic N, Hansen P. Variable neighborhood search [J]. Computers and Operations Research. 1997, 24 (11): 1097-1100. |
| [5] | Wang Renming. Improved variable neighourhood search algorithm for VDRP [J]. Computer Engineering and Applications, 2014, 50 (2): 237-241. |
| [6] | Li Ning. Particle Swarm Optim ization for Vehicle Routing Problem with Time windows [J]. Systems Engineering-Theory & Practice, 2004 (4): 130-135. |
| [7] |
Section. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm [J]. < |
| [8] |
DC Paraskevopoulos, PP Repoussis, CD Tarantilis, G Ioannou, GP Prastacos. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows [J].< |
| [9] |
A Stenger, M Schneider, D Goeke. The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost [J].< |
| [10] |
PP Xiong, YG Dang, T Yao, J Cui. The Research on the Modeling Method of Background Value Optimization in Grey Verhulst Model [J].< |
| [11] |
LI Fu-Chang, Y Wang, ZF Zhang. Transportation and Inventory Outsourcing Decision-makings of Fourth Party Logistics Based on Third Party Logistics Competition [J].< |
APA Style
Yawei Li, Yandong Li, Xiaorong Li. (2016). The Time Window Model and Shortest Path Model Design for Travel All 5A Scenic Spot in China. American Journal of Applied Mathematics, 4(4), 192-196. https://doi.org/10.11648/j.ajam.20160404.15
ACS Style
Yawei Li; Yandong Li; Xiaorong Li. The Time Window Model and Shortest Path Model Design for Travel All 5A Scenic Spot in China. Am. J. Appl. Math. 2016, 4(4), 192-196. doi: 10.11648/j.ajam.20160404.15
AMA Style
Yawei Li, Yandong Li, Xiaorong Li. The Time Window Model and Shortest Path Model Design for Travel All 5A Scenic Spot in China. Am J Appl Math. 2016;4(4):192-196. doi: 10.11648/j.ajam.20160404.15
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ajam.20160404.15,
author = {Yawei Li and Yandong Li and Xiaorong Li},
title = {The Time Window Model and Shortest Path Model Design for Travel All 5A Scenic Spot in China},
journal = {American Journal of Applied Mathematics},
volume = {4},
number = {4},
pages = {192-196},
doi = {10.11648/j.ajam.20160404.15},
url = {https://doi.org/10.11648/j.ajam.20160404.15},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajam.20160404.15},
abstract = {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.},
year = {2016}
}
TY - JOUR T1 - The Time Window Model and Shortest Path Model Design for Travel All 5A Scenic Spot in China AU - Yawei Li AU - Yandong Li AU - Xiaorong Li Y1 - 2016/08/02 PY - 2016 N1 - https://doi.org/10.11648/j.ajam.20160404.15 DO - 10.11648/j.ajam.20160404.15 T2 - American Journal of Applied Mathematics JF - American Journal of Applied Mathematics JO - American Journal of Applied Mathematics SP - 192 EP - 196 PB - Science Publishing Group SN - 2330-006X UR - https://doi.org/10.11648/j.ajam.20160404.15 AB - 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. VL - 4 IS - 4 ER -
Email: