This question is regarding Solving Travelling Salesman Problem(TSP) using the Elastic Net method. Python/Java Code is required to solve and show the answers to all the bullet points.

 

Please refer to the "An analog approach to the traveling salesman problem using an elastic net method" by Richard Durbin & David Willshaw research paper 

 

Implement the elastic net TSP by minimizing the following objective function N M ETSP(PY) Piai ya||| + i=1 a=1 - M a=1 ||ya-ya+1|| Document the settings of the free parameters K, (the inverse temperature) and M, the number of hidden and actual cities If reducing K, provide the rate, the total number of iterations etc. If steadily increasing , provide the rate and total number of iterations Document initial conditions on Y. Execute the elastic net on 100 cities in [0,1] chosen using a uniform distribution. Since we require average performance, please compute the average tour length for 100 trials and show a histogram of tour lengths Show visual examples of the shortest, longest and median length tours for the 100 city TSP