An Innovative Tour Recommendation System using Graph Algorithms

Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI). Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of this paper. Most of the time people had to find the places he wants to visit in a difficult way. It kills a lot of time. Methods: To cope with this situation we have used different methodology. First, a greedy algorithm is used for filtering the POIs and BFS (Breadth First Search) algorithm will find POI in terms of user interest. The maximum number of visited POI within a limited time will be considered. Then, the Dijkstra algorithm finds the shortest path from the point of departure to the end of tours. Results:  This work shows its users list of places according to the user's interest in a particular city. It also suggests them places to visit in a range from the location of the user where a user can dynamically change this range and it also suggests nearby places they may want to visit. Conclusion: This tour recommendation system provides its users with a better trip planning and thus makes their holidays enjoyable.