GitHub - Treehopper/Traveling-Python: Solving the Traveling Salesman Problem with Simulated Annealing

Treehopper / Traveling-Python Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Solving the Traveling Salesman Problem with Simulated Annealing - A quick hack in Python

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
COPYING		COPYING
README		README
edge.py		edge.py
graph.py		graph.py
node.py		node.py
sa.py		sa.py

Repository files navigation

This is certainly not yet an implementation that should be used in production, but may be a convenient point to begin with such an implementation.
I used the pseudo code from wikipedia as an outline, hence the implementation may not be "pure" Simulated Annealing but already contain certain optimizations.
<http://en.wikipedia.org/wiki/Simulated_Annealing#Pseudocode>