Skip to content

Latest commit

 

History

History
executable file
·
10 lines (6 loc) · 477 Bytes

README.md

File metadata and controls

executable file
·
10 lines (6 loc) · 477 Bytes

Artificial Intelligence Engineer Nanodegree

Simulated Annealing

The Traveling Saleman Problem

This exercise shows my 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