A Java implementation of ACO algorithms for the TSP

This software provides an implementation of various Ant Colony Optimization (ACO) algorithms for the symmetric Traveling Salesman Problem (TSP).


Source code

Get the source code of the latest stable release

Project information

ACOTSPJava is based on the ACOTSP project of Thomas Stuetzle:
ACO algorithms for the TSP

The original code was ported from C to Java by Adrian Wilke. This was done for a project of the course 'Swarm intelligence' of Marco Dorigo at the University of Paderborn.


Adrian Wilke