Java ACO algorithms for the TSP (original) (raw)

ACOTSPJava

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).

Download

• Version 1.0.1 (Zip-File, based on ACOTSP 1.0.3)
• Version 1.0.0 (Zip-File, based on ACOTSP 1.0.2)

Source code

Get the source code of the latest stable release

• Version 1.0.1 (Zip-File, based on ACOTSP 1.0.3)
• Version 1.0.0 (Zip-File, based on ACOTSP 1.0.2)
• Browse current source code at GitHub

Project information

ACOTSPJava is based on the ACOTSP project of Thomas Stuetzle:
ACO algorithms for the TSP www.aco-metaheuristic.org/aco-code/public-software.html

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.

Contact

Adrian Wilke
http://adrianwilke.de/