Tourism Route Plan Algorithm Based on Sight Spot Buffer Motive Iteration

DOI

10.2991/mmsa-18.2018.37How to use a DOI?

Keywords

sight spot buffer; tourism motive; motive iteration; route plan

Abstract

Currently, tourism plan cannot fully consider tourists’ individual interests. And routes planned cannot meet tourists’ best motive benefits. As to the problems, this paper brings forward tourism route plan algorithm basing on sight spot buffer motive iteration. Firstly, sight spot buffer model is set up and sight attracting factors and indexes are confirmed, on which basis, sight spot interval iteration model is set up. Through test example, optimal and suboptimal tourism routes which meet individual interests and best motive benefits are obtained. Example proves that this algorithm model can fully consider tourists’ interests and output tourism routes to meet tourists’ motive benefits, which is feasible and practical.

Copyright

© 2018, 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  - Xiao Zhou
AU  - Kuiliang Gao
AU  - Yingcai Lun
AU  - Jiang Zhu
AU  - Zhenning Yang
AU  - Qi Tong
PY  - 2018/03
DA  - 2018/03
TI  - Tourism Route Plan Algorithm Based on Sight Spot Buffer Motive Iteration
BT  - Proceedings of the 2018 International Conference on Mathematics, Modelling, Simulation and Algorithms (MMSA 2018)
PB  - Atlantis Press
SP  - 169
EP  - 172
SN  - 1951-6851
UR  - https://doi.org/10.2991/mmsa-18.2018.37
DO  - 10.2991/mmsa-18.2018.37
ID  - Zhou2018/03
ER  -