Consider the traveling salesperson (TSP) problem with cities. The corresponding distance matrix is given below. Recall that in TSP, each city is visited exactly once and then the traveler returns to the initial city. Find the shortest tour by using the branch and bound method for the TSP problem that we covered in class. Remember that you must use the Hungarian method to solve the relaxations. Write the optimal solution and its length explicitly.
Added by Jacqueline V.
Close
Step 1
First, we need to find the reduced cost matrix using the Hungarian method. Let's assume the given distance matrix is D. Show more…
Show all steps
Your feedback will help us improve your experience
Israel Hernandez and 89 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider the traveling salesman problem with 5 cities. You can start solving this TSP by using the branch and cut algorithm, initially focusing on the assignment type constraints. Let's say the optimal solution has the following 2 subtours. Find the subtour elimination constraints that will eliminate this particular solution.
Sri K.
Given a list of cities and their pair wise distances, the task is to find a shortest possible tour that visits each city exactly once. A salesman has to visit five cities A, B, C, D and E. The distances (in hundred kilometers) between the five cities are shown in the following Table: If the salesman starts from city A and has to come back to city A. Use a new Alternate Method of an assignment problem to find out, which route should he selects so that the total distance traveled becomes minimum.
Donna D.
Given a set of locations and distances between them, the goal of the Traveling Salesperson Problem (TSP) is to find the shortest tour that visits each location exactly once. Assume that you do not return to the start location after visiting the last location in a tour. We would like to solve the TSP problem using a greedy hill-climbing algorithm. Each state corresponds to a permutation of all the locations (called a tour). The operator neighbors(s) generates all neighboring states of state s by swapping two locations. For example, if s = <A-B-C> is a tour, then <B-A-C>, <C-B-A> and <A-C-B> are the three neighbors generated by neighbors(s). Use as the evaluation function for a state the length of the tour, where each pairwise distance is given in a distance matrix. For example, if s = <A-B-C> is a tour, then its total length is d(A, B) + d(B, C) where d(A, B) is the distance between location A and B. (a) [3] If there are n locations, how many neighboring states does the neighbors(s) function produce? (b) [3] What is the total size of the entire search space, i.e., the total number of states, when there are n locations?
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
