Tourist route optimization design and algorithm

DOI

10.2991/isci-15.2015.264How to use a DOI?

Keywords

Dijskra algorithm; Shortest path; Tourism; Model

Abstract

Take ten tourist attractions in Lanzhou as the example to design one-day trip at Lanzhou plan model. Through Dijskra algorithm to find the shortest path and the path which spent the shortest time, and analys the result to get the way which is the best solution, use the target node in the first time as the source point, calculate the optimal path of the next goal node, iterate them one by one according to their own needs, and then optimize the tourism of the shortest path.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yong-lin Xu
AU  - Sheng-zhi Zhang
AU  - Jin Yang
PY  - 2015/01
DA  - 2015/01
TI  - Tourist route optimization design and algorithm
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 2012
EP  - 2019
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.264
DO  - 10.2991/isci-15.2015.264
ID  - Xu2015/01
ER  -