https://github.com/lucko515/simulated-annealing

One of many projects done in Artificial Intelligence Nanodegree @Udacity. This project was to use Simulated Annealing algorithm to solve Traveling salesman problem.
https://github.com/lucko515/simulated-annealing

aind artificial-intelligence simulated-annealing traveling-salesman

Last synced: about 1 month ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/lucko515/simulated-annealing
• Owner: lucko515
• License: other
• Created: 2017-07-23T09:30:40.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2017-07-23T09:32:00.000Z (almost 8 years ago)
• Last Synced: 2025-02-01T17:23:46.270Z (3 months ago)
• Topics: aind, artificial-intelligence, simulated-annealing, traveling-salesman
• Language: Jupyter Notebook
• Size: 1.57 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
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