Skip to content

One of many projects done in Artificial Intelligence Nanodegree @udacity. This project was to use Simulated Annealing algorithm to solve Traveling salesman problem.

Notifications You must be signed in to change notification settings

lucko515/simulated-annealing

Repository files navigation

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

About

One of many projects done in Artificial Intelligence Nanodegree @udacity. This project was to use Simulated Annealing algorithm to solve Traveling salesman problem.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published