A C++ implementation of the Ant System algorithm for solving symmetric Travelling Salesman Problem (TSP).
Datasets are from TSPLIB.
Currently, only problems which have distance type EUC_2D or EUC_3D can be handled by this program.
To compile, run: make
To execute: ./aco datasets/eil51.tsp