Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 26 Oct 2025 · September 2025 term

Question 20: TSP\ Use the distance matrix to construct TSP tours. | |…

Question 20

+1 markOne or more correct options

TSP
Use the distance matrix to construct TSP tours.

ABCDE
A-18309054
B18-488436
C3048-6072
D908460-24
E54367224-

Based on the above data, answer the given subquestions.

Consider N cities in a Euclidean plane and use the Euclidean Distance as the distance measure. For each city, take that city as the fulcrum (base) city and compute its Savings tour. From the resulting N Savings tours, select the cheapest tour. What can you conclude about the above procedure?

Select all that apply.

  1. A

    This procedure can be used to compute the optimal TSP tour.

  2. B

    This procedure is not suitable for computing the optimal TSP tour.

  3. C

    This procedure may not always terminate.

  4. D

    This procedure will always terminate.

Show answer

Correct answers

  • B

    This procedure is not suitable for computing the optimal TSP tour.

  • D

    This procedure will always terminate.

See the whole paperTake it as a mock test

Question 20 of 20 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 26 Oct 2025, in the September 2025 term (IIT M DEGREE AN EXAM QDB2 26 Oct 2025). It carries 1 mark.

More questions from this paper

  1. Q1STATE SPACE\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one po…
  2. Q2STATE SPACE\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one po…
  3. Q3STATE SPACE\ Consider 3-puzzle (a smaller version of 8-puzzle) where a tile (carrying a numeric label) can slide one po…
  4. Q4SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  5. Q5SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  6. Q6SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  7. Q7SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  8. Q8SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  9. Q9SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  10. Q10SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  11. Q11SEARCH\ The MoveGen function and the heuristic function for a state space is provided below. Take S as the start node a…
  12. Q12Convert the path representation A,C,K,F,B,H,G,I,D,L,E,J to ordinal representation. Use A,B,C,...,L as the reference (in…
  13. Q13Path representations of two tours are given below. Generate offspring using Cycle Crossover. P1: I,D,L,E,J,A,C,K,F,B,H,…
  14. Q14Single-point crossover can be used with .
  15. Q15For the case of 3-edge exchange, how many child tours are possible? Enter the number of child tours in the text box. (A…
  16. Q16TSP\ Use the distance matrix to construct TSP tours. | | A | B | C | D | E | |---|---|---|---|---|---| | A | - | 18 | 3…
  17. Q17TSP\ Use the distance matrix to construct TSP tours. | | A | B | C | D | E | |---|---|---|---|---|---| | A | - | 18 | 3…
  18. Q18TSP\ Use the distance matrix to construct TSP tours. | | A | B | C | D | E | |---|---|---|---|---|---| | A | - | 18 | 3…
  19. Q19TSP\ Use the distance matrix to construct TSP tours. | | A | B | C | D | E | |---|---|---|---|---|---| | A | - | 18 | 3…