(Solved) : 10 Goal Traveling Salesman Problem Tsp Determine Shortest Route Tour Starts Salesperson S Q33142397 . . .
Need help to answer this question with explanation please
![10) The goal of the Traveling Salesman Problem (TSP) is to determine a shortest route (tour) that starts at the salespersons home city, visits each city once, and ends at the home city Let the cities be c1, c2, c3 and c4, and the home city is c1 Let D[O[A] be the cost of the minimum cost path visiting each city in set A exactly once starting the home city and ending at city ci. If set A is an empty set, the DL]A-WII, İ)(W-distance matrix) If set A is not an empty set, DO[A] can be formulated as follows The distance matrix is Calculate D[2, A], D[3, A], DI4, A] for the following values of A iven below: and show your steps a) A is an empty set, what is DI2, A], D[3, A], DI4, A] ? b) A is {c2], what is D[3, A], D[4, A] c) A is c3), what is D[2, A], D[4, A] 0 115 6 C2 07 3 9 6 0 12 108d)A is (ca), what is DI2, A], DI3, A] e) A is (c2, c3), what is DI4, A] f) A is (c2, c4), what is D[3, A] g) A is (c3, c4), what is D[2, A] h) When A is (c2, C3, c4), what is D[1, A] i) What is the cost of the optimal TSP tour?](https://media.cheggcdn.com/media%2Fe92%2Fe929c4ad-e7bd-4223-bd3e-560ed7ae9d00%2FphpQUyulC.png)
10) The goal of the Traveling Salesman Problem (TSP) is to determine a shortest route (tour) that starts at the salesperson’s home city, visits each city once, and ends at the home city Let the cities be c1, c2, c3 and c4, and the home city is c1 Let D[O[A] be the cost of the minimum cost path visiting each city in set A exactly once starting the home city and ending at city ci. If set A is an empty set, the DL]A-WII, İ)(W-distance matrix) If set A is not an empty set, DO[A] can be formulated as follows The distance matrix is Calculate D[2, A], D[3, A], DI4, A] for the following values of A iven below: and show your steps a) A is an empty set, what is DI2, A], D[3, A], DI4, A] ? b) A is {c2], what is D[3, A], D[4, A] c) A is c3), what is D[2, A], D[4, A] 0 115 6 C2 07 3 9 6 0 12 108d)A is (ca), what is DI2, A], DI3, A] e) A is (c2, c3), what is DI4, A] f) A is (c2, c4), what is D[3, A] g) A is (c3, c4), what is D[2, A] h) When A is (c2, C3, c4), what is D[1, A] i) What is the cost of the optimal TSP tour? Show transcribed image text
Expert Answer
Answer to 10 Goal Traveling Salesman Problem Tsp Determine Shortest Route Tour Starts Salesperson S Q33142397 . . .
OR