Skip to content

Latest commit

 

History

History
24 lines (16 loc) · 631 Bytes

README.md

File metadata and controls

24 lines (16 loc) · 631 Bytes

Simulated Annealing

Introduction

Implement simulated annealing to solve the Traveling Salesman Problem (TSP) between US state capitals.

There are four main steps:

  • Step 1: Implement the simulated_annealing() main loop function
  • Step 2: Implement the TravelingSalesmanProblem class
  • Step 3: Define the temperature schedule
  • Step 4: Solve larger TSP instances on the map of US capitals

Setup

  • Python 3
  • numpy
  • matplotlib
  • json

Run

To open a notebook, use:

jupyter notebook <notebook.ipynb>