/simulated-annealing-tsp

A Jupyter notebook exercise to demonstrate simulated annealing on the traveling salesman problem

Primary LanguageJupyter NotebookOtherNOASSERTION

In this exercise you will check your understanding of simulated annealing by implementing the algorithm in a Jupyter notebook and using it to solve the Traveling Salesman Problem (TSP) between US state capitals.

To launch the notebook, run the following command from a terminal with anaconda3 installed and on the application path:

jupyter notebook AIND-Simulated_Annealing.ipynb