PlanIT: An Itinerary Planner using K-Means Clustering and Travelling Salesman Problem
Sunayana Jadhav, Dhruv Kothari, Deep Gori, Dhruv Joshi, Bhavik Mehta · 2023
Travelling can be a stressful experience despite being a significant aspect of one's life. It involves various tasks, such as choosing destinations, scheduling trips, and booking accommodation and transportation, which can be tedious. Several factors like travel goals, budget, time constraints, group size, and personal preferences contribute to the challenge of creating a travel itinerary. A database consisting of various tourist destinations is created, then based on the user's preferences, clusters are created from the database to create an itinerary using it. Then using K-Means clustering and Travelling Salesman Problem (TSP) a route plan will be created, providing the user with the itinerary in its final form where it shows the details of which tourist destination to visit at what time based on the preferences set by the user.