Skip to content

In this exerciseI demonstrate 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.

Notifications You must be signed in to change notification settings

fatemehmirzadeh/Traveling-Saleman-with-AI

 
 

Repository files navigation

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

About

In this exerciseI demonstrate 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.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 100.0%