Subject
Computer Science
Topic
Artificial Intelligence
In the travelling salesman problem, what must the salesman find?
In the travelling salesman problem, what must the salesman find?
a)
The longest route between two citiesb)
The shortest tour that visits every city exactly once and returns homec)
Any route that visits at least one cityd)
The city with the most roadsExplanation
TSP is a classic hard (NP-hard) optimisation problem often attacked with heuristic and local search.Related questions
In the figure, using alphabetical tie-breaking, what is the breadth-first visit order from A?In the figure, using alphabetical tie-breaking, what is the depth-first preorder from A?In the figure, using alphabetical tie-breaking, what is the uniform-cost path cost from S?In the figure, what is the cost of the path that A* search returns from S to G, assuming its heuristic is admissible?For edges P-Q-1,P-R-1,Q-S-1,R-T-1,S-U-1, what order does DFS preorder produce from P with alphabetical tie-breaking?Using uniform-cost search on weighted edges S-A-2,S-B-6,A-C-2,B-C-1,C-G-4, what is the least cost from S to G?A heuristic gives values 5,3,0; the corresponding true remaining costs are 4,3,0. Is it admissible?A unit-cost tree has a very shallow solution but high branching. Which complete uninformed method is the natural choice?