(Answered) : The Traveling Salesman

Question Description

Optimization ProjectObjective• Explore Applications of Graph Theory and Combinatorics• Identify why certain problems are difficult to solve efficiently• Explore the use of HeuristicsInstructionsAnswer all numbered questions in the DocumentIntroductionThe traveling salesman problem is stated as “Given a list of cities and the distances between each pair of cities, what is theshortest possible route that visits each city and returns to the origin city?”Brute Force Search1. Write all possible circuits for the graph in the form Example: There will be 24 possible circuits to list2. For each circuit, calculate the total distance traveledThe total distance is the sum of