This is an implementation of an Ant Colony System (ACS) to solve the Traveling Salesman Problem (TSP). It supports both sequential and parallel versions.
In doc/tsp-acs.pdf the algorithm is described in detail and a comparison of performance is discussed.
- Felipe Ramirez
./tsp-acs <data> <number_of_ants> <use_threads>
datais an instance of the TSPnumber_of_antsis the number of ants to be routeduse_threadswhether0or1