Python Program – USE HILL CLIMBING ALGO
The traveling salesman problem is an optimization problem wherethere is a finite number of cities, and the cost of travel betweeneach city is known. The goal is to find an ordered set of all thecities for the salesman to visit such that the cost or totaldistance traveled by the salesman is minimized.
The following shoes some cities in US and the route that isoptimal for the salesman to follow to minimize the totaldistance.
Generate 15 random points or cities in python. Each point can berepresented by a location tuple (x,y). Assume x ranges from 0-5 andy
OR
OR