(30 points) The travelling salesperson problem (TSP) is something we solved using integer programmingearlier in the semester. The problem is to find the shortest possible route through a given list of citieswhen supplied with the distances between each pair of cities. Each city must be visited exactly once andreturns to the origin city. This problem can also be solved using simulated annealing.
For the sake of this question, assume you are trying to solve this problem for a list of 8 cities namedA,B,C,D,E,F,G,H with distances between cities i and j denoted as di,j
In the context of simulated annealing, answer the following questions:
(a) Provide one way in which you could represent a solution to this TSP problem in code.(b) Now describe a reasonable neighbor generation algorithm for this strategy representation.(c) Finally, describe how you would calculate the fitness of a strategy.
Note: coding is not required. Pseudo code or written description is sufficient.
"Place your order now for a similar assignment and have exceptional work written by our team of experts, guaranteeing you A results."