TSP solver using Ant Colony Optimization

This project is a Go implementation of the Ant System algorithm proposed by M. Dorigo et al.

The main goal of this project was to produce a functional implementation of this algorithm and to test it against real world data to compare performance and accuracy of the algorithm. It was also a nice way to learn the basics of the Go language !

There's also a Node.js implementation available here!

Installation

Download the latest version for macOS under the releases section

Build from source

To build from source, you will need the go compiler and the vgo tool

Clone this repository and move to the sources directory

$ git clone <repository-url> go-tsp-aco
$ cd go-tsp-aco

$ vgo build

And voilà ! The compiler generated a binary named go-tsp-aco 🚀

Usage

The following flags are available :

• -input : loads the given .tsp file.
• -alpha : value of the alpha parameter.
• -beta : value of the beta parameter.
• -ants : number of ants per generations.
• -generations : number of generations to simulate.
• -evaporation : value for the pheromones evaporation rate.
• -h or --help : displays the help message.

Licence

MIT