AI BASED TRIP PLANNER (SAFAR KA SAATHI)

AI BASED TRIP PLANNER (SAFAR KA SAATHI)

1                             2                           3                          4                 5

Chandana C, Shubham Mittal, Saloni Kumari, Shivangi Singh, Vinod S

1 Assistant Professor, Department of Computer Science Engineering, SJBIT, Bengaluru, 560060

2,3,4,5Student, Department of Computer Science and Engineering, SJBIT, Bengaluru, 560060

Abstract — Trip planner applications are developed using the capabilities of advanced computing and the accessibility of cellphones. They have quickly gained popularity as a tourism tool due to their versatility. Customers can plan a trip with little effort and a few simple clicks. We are also incorporating social components, such as the opportunity to create a vacation club to discuss spending and images. Tourists face a number of challenges, including the inability to rely on local guides due to their ties to local businesses and the risk of being overcharged. The Traveling Salesman Issue (TSP) is an NP-hard problem that will be extensively used to discover the best route for our tour. There are various map APIs available, including Google Maps and Azure Maps. We will, however, use the Google Maps API to collect the distance matrices of the user's preferred sites, and then apply our algorithm to this matrix to produce a viable route.

Keywords — NP-hard problem, Trip planner, Salesman Problem, Traveling, suitable route