Research on Optimal Travel Route Recommendation Algorithm Based on Time Sensitive Conditional Transition Graph Under Multiple Constraints

ABSTRACT Overcrowding of tourists at scenic spots can easily lead to safety accidents and a decline in tourists' travel experience. Designing or recommending tourist routes for tourists is an effective method of passenger flow guidance. The crowdedness of scenic spots is used to describe the crowded conditions of scenic spots, and a tourism experience utility function is proposed. Based on this, considering the constraints of scenic spot service time, travel time and cost budget, a travel route optimization model based on the maximization of travel experience utility is established, and an ant colony algorithm is designed to solve it. On this basis, a time‐sensitive travel route recommendation method based on dynamic transition graphs is proposed, a dynamic transition graph model method based on hierarchical clustering is constructed, a method for removing popular sequence anomalies is designed, and a stable pattern law is established. The pattern law accurately recommends the best tourist route suitable for the user's travel time. Through the experimental verification of real data, compared with the existing work, the user's income has increased by more than 10%, which verifies the effectiveness of the proposed method.