Skip to content

implement simulated annealing to solve the Traveling Salesman Problem between US state capitals

Notifications You must be signed in to change notification settings

ntrang086/simulated_annealing

Repository files navigation

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>

About

implement simulated annealing to solve the Traveling Salesman Problem between US state capitals

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published