Extension of the Traveling Salesman Problem on Tourism in California
Bojun Cui, Siyuan Lang, Baolong Huang, Weiyuan Cao · 2023
This paper focuses on a specific instance of the Traveling salesman problem (TSP). We want to find the route with the lowest cost of 10 places we select randomly. We chose this topic to investigate how we can use Travelling Salesman Problem, or an extension of it with more variables and constraints, to minimize the cost of tourists given certain tourist attractions they must visit. The proposed method to solve the problem uses Python's comparing method and loops method to find the best route. The result we get in this research is that we find the optimal solution of the example of TSP with all the data we have found.