Next Article in Journal
Fusion of Multi-Sensor-Derived Heights and OSM-Derived Building Footprints for Urban 3D Reconstruction
Previous Article in Journal
Automatic Building Footprint Extraction from Multi-Resolution Remote Sensing Images Using a Hybrid FCN
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle

Individualized Tour Route Plan Algorithm Based on Tourist Sight Spatial Interest Field

Tourism Department, Leshan Vocational and Technical College, Leshan 614000, China
Information Engineering University, Zhengzhou 450001, China
Institute of Information Engineering, Zhengzhou University of Industrial Technology, Zhengzhou 451159, China
State Key Laboratory of Geo-Information Engineering, Xi’an 710054, China
Xi’an Research Institute of Surveying and Mapping, Xi’an 710054, China
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2019, 8(4), 192;
Received: 12 March 2019 / Revised: 30 March 2019 / Accepted: 10 April 2019 / Published: 17 April 2019
PDF [3604 KB, uploaded 24 April 2019]
  |     |  


Smart tourism is the new frontier field of the tourism research. To solve current problems of smart tourism and tourism geographic information system (GIS), individualized tour guide route plan algorithm based on tourist sight spatial interest field is set up in the study. Feature interest tourist sight extracting matrix is formed and basic modeling data is obtained from mass tourism data. Tourism groups are determined by age index. Different age group tourists have various interests; thus interest field mapping model is set up based on individual needs and interests. Random selecting algorithm for selecting interest tourist sights by smart machine is designed. The algorithm covers all tourist sights and relative data information to ensure each tourist sight could be selected equally. In the study, selected tourist sights are set as important nodes while iteration intervals and sub-iteration intervals are defined. According to the principle of proximity and completely random, motive iteration clusters and sub-clusters are formed by all tourist sight parent nodes. Tourist sight data information and geospatial information are set as quantitative indexes to calculate motive iteration values and motive iteration decision trees of each cluster are formed, and then all motive iteration values are stored in descending order in a vector. For each cluster, there is an optimal motive iteration tree and a local optimal solution. For all clusters, there is a global optimal solution. Simulation experiments are performed and results data as well as motive iteration trees are analyzed and evaluated. The evaluation results indicate that the algorithm is effective for mass tourism data mining. The final optimal tour routes planned by the smart machine are closely related to tourists’ needs, interests, and habits, which are fully integrated with geospatial services. The algorithm is an effective demonstration of the application on mass tourism data mining. View Full-Text
Keywords: spatial interest field; individuality; tour guide route; motive iteration; decision tree; cluster analysis spatial interest field; individuality; tour guide route; motive iteration; decision tree; cluster analysis

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Zhou, X.; Zhan, Y.; Feng, G.; Zhang, D.; Li, S. Individualized Tour Route Plan Algorithm Based on Tourist Sight Spatial Interest Field. ISPRS Int. J. Geo-Inf. 2019, 8, 192.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top