CpE 4040 Homework -3
Use the sample code (simAnnealingTSP.py) to solve TravelingSalesman Problem using Simulated Annealing algorithm. The givencode includes names and coordinates of 20 US cities. Complete thefollowing tasks:
Modify and extend the list of cities to form 40 cities in 40different states starting from Atlanta. Find the latitudes andlongitudes of these cities and enter in the list.
The algorithm tries to calculate the shortest route to travelthese cities starting from the first/home city (Atlanta) and visitall the cities and return back to home city. Run the code toperform Simulated Annealing optimization algorithm to calculate thebest possible route.
Repeat running the code for
OR
OR