The Travelling Salesman Problem

• The travelling salseman problem is our first coursework.
• The salseman has to go through all of the cities once and return to the start. He has to do this in the shortest distance.
• In groups of three or four, discuss how you would represent the cities and their distances.
• Now discuss a mechanism that solves it quickly.(0-30)
• Now discuss a mechanism that solves it optimally.(30-50)
• Now discuss a mechanism that solves it optimally and quickly. (50-90)
• Now discuss a mechanism that solves it very well and quickly. (90-100)