Smart Tour Route Planning Algorithm Based on Clustering Center Motive Iteration Search

Tour route planning is hot research issue of smart tourism and tourism GIS. Reasonable tour route can help tourists get best motive benefit satisfaction. According to common tour route planning method and existing problems, smart tour route planning algorithm based on clustering center motive iteration search is brought forward in the study. Tourist sight data set and subset are set up and interest tourist sight empty vector is formed to store optimal interest tourist sight. Based on individual needs, tourist's temporary accommodation in the downtown is set as clustering center to build optimal tourist sight extracting algorithm. Motive iteration interval and sub-interval are defined to build one-way shortest path algorithm to output shortest path between clustering center and tourist sight and between two tourist sights. Combining with positive and negative motive benefit impact factors, sub motive iteration values and motive iteration values are formed by iteration functions. Then descending order complete binary tree is generated to output and store motive iteration values and the optimal closed-loop structure with tour route, meanwhile, sub-optimal closed-loop structures with tour routes are also output. Experiment is designed and performed, sample tourists are selected to provide interest needs, and optimal tourist sight generation tree, all closed-loop structures and motive iteration values are obtained. Experiment indicates that the algorithm can solve problems of common tour route planning, meet the individual needs of tourists and provide them with optimal tourist sights and route to get best motive benefits.