Abstract

The location social network generates a large amount of data; these dada reflect the user's preferences and the popularity of the route, and a new model is provided for travel route search. Based on this demand, a problem of local distributed travel route search is proposed for group users. In this problem, the personal preferences of group users are combined, and an access route is found with partial POI (point of interest) and the largest group profit. The check-in data are used to generate a POI transfer relationship diagram based on the user's transfer between POIs, and route search is performed on the relationship diagram. In order to improve the search efficiency, a two-layer transfer relationship diagram is designed according to the popularity and transfer relationship of POI, the POI is generalized, and a hierarchical query is realized. A branch and bound search strategy optimization algorithm is designed, and the control relationship between nodes is used for pruning; the search efficiency of the algorithm is further improved.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call