Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Solves the TSP using multithreaded ACO method
branch: master
Failed to load latest commit information.
README Update README
ant.py Everything you need
antcolony.py Everything you need
antgraph.py Everything you need
anttsp.py Everything you need
citiesAndDistances.pickled Everything you need

README

Python Ant Colony TSP Solver
-----------------------------

Uses Ant Colony Optimization to solve the TSP.  See http://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms 

anttsp.py is the file to run.  It reads from citiesAndDistances.pickled, which is a pickled 2D array with this format:
CityName1  CityName2 ... CitNameN
0           23               34         
10           0               22
.
.
.

It is not necessary for the matrix to be symmetric i.e. the distance traveling from A to B need not be the distance from B to A  (if you have ever been to Italy and dealt with the mess of one-way streets you will understand how this applies).

Run without additional arguments, it solves the 10-city TSP

You can also try this:
python anttsp.py 14

Other values <= 14 tested as well

Something went wrong with that request. Please try again.