Quiz Space

AI: Search Methods for Problem Solving · Quiz 1 · 25 Feb 2024 · January 2024 term

Question 18: TSP\ The distance matrix for 6 cities and corresponding …

Question 18

+1 markNumerical answer

TSP
The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this information to construct TSP tours.

ABCDEF
A-6632187340
B66-92148160
C3292-261652
D181426-6880
E73811668-84
F4060528084-
BDCEADCDAC
1416182632
AFCFBFABDE
4052606668
AEDFBEEFBC
7380818492

Based on the above data, answer the given subquestions.

What is the cost of the tour generated by Nearest Neighbour Heuristic?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: 17

Show answer

Correct answer: 229

See the whole paperTake it as a mock test

Question 18 of 21 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 1 paper sat on 25 Feb 2024, in the January 2024 term (IIT M DEGREE AN2 EXAM QDB2 25 Feb 2024). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2STATE SPACE\ One needs to count the number of nodes visited in each cycle of DFID .
  3. Q3STATE SPACE\ In the Ant Colony Optimisation algorithm for solving the TSP .
  4. Q4STATE SPACE
  5. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q8SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  9. Q9SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  10. Q10SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  11. Q11SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  12. Q12SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  13. Q13Genetic Algorithm\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,...,L as the reference (in…
  14. Q14Genetic Algorithm\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,...,L as the reference (in…
  15. Q15Genetic Algorithm\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,...,L as the reference (in…
  16. Q16Genetic Algorithm\ A tour of 12 cities is shown below. The edges are bi-directional. Use A,B,...,L as the reference (in…
  17. Q17TSP\ The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this infor…
  18. Q19TSP\ The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this infor…
  19. Q20TSP\ The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this infor…
  20. Q21TSP\ The distance matrix for 6 cities and corresponding edge costs (in sorted order) are provided below. Use this infor…