基于兴趣旅游景点精准数据挖掘的旅游线路规划算法,IEEE Access

Tour Route Planning Algorithm Based on Precise Interested Tourist Sight Data Mining

Aimed at current problems in tour route planning, this research proposes a tour route planning algorithm based on the data mining of tourist sights based on their precise interest. It further studies on the aspect of tourist interests and needs, tourist sight feature attributes, data mining of tourist sights based on their precise interest and optimal tour route planning, and then designs and performs experiment to testify the feasibility and superiority of the algorithm. First, tourist interest and need label matrix and tourist sight feature attribute matrix are set up. Tourist sight attribute factor is formed by mining text encyclopedic data, and combining with other factors, tourist sight clustering algorithm is set up to output tourist sight clusters. Second, data mining algorithm of tourist sights based on their precise interest is set up, which outputs the optimal tourist sights not only match the tourists' interests and needs but also optimally distribute around to produce the lowest travel costs. Third, based on precise interested tourist sights, combining with geographic information data, traffic information data and tourist sight information data, optimal tour route planning algorithm based on interest label is set up. It outputs maximum heap and complete binary tree with descending order interval motive values and corresponding edge clipping circle, which directly reflects the satisfaction content of each tour route on tourists. Tourist sight domain and geographic spatial data of Zhengzhou city are collected as basic data to design the experiment, and it testifies the algorithm's feasibility, effectiveness and practicalness. Meanwhile, the experiment brings in three commonly used route planning algorithms as control group to make comparison with the developed algorithm on the aspect of optimal route, motive value, motive value difference, algorithm performance and guide map,etc., which testifies that the developed algorithm has superiority to traditional algorithms. The research indicates that this developed algorithm solves the problems on tour route planning and it is an effective, feasible and practical algorithm.