https://github.com/anty-filidor/simulated-annealing-tsp

Simple simulated annealing heuristic for TSP
https://github.com/anty-filidor/simulated-annealing-tsp

experiment heuristics python

Last synced: 3 months ago
JSON representation

Simple simulated annealing heuristic for TSP

• Host: GitHub
• URL: https://github.com/anty-filidor/simulated-annealing-tsp
• Owner: anty-filidor
• Created: 2019-10-26T13:52:38.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-11-13T11:38:48.000Z (almost 6 years ago)
• Last Synced: 2025-02-21T14:24:23.494Z (8 months ago)
• Topics: experiment, heuristics, python
• Language: Python
• Homepage:
• Size: 34.2 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

          
## Simulated annealing algorithm for travelling salesman problem

Program includes two classes:

* datasets

* simulated annealing

Datasets used in experiments are avaliable [here](https://wwwproxy.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/STSP.html).

Usage of algorithm:

`SA = SimulatedAnnealing(data, name)`

`stats = SA(t_start=3000, t_min=10)`

Example visualisation of performed experiment:

![experiment](example.png)

This is an implementation oh heuristic described [here](https://tdb0.wordpress.com/2010/12/03/symulowane-wyzarzanie/)