Ant Colony Optimization

A Java implementation of a parallel algorithm inspired by the search patterns of foraging ant colonies for generating optimal solutions to the Traveling Salesman Problem. Based primarily on the work of Marco Dorigo and Thomas Stutzle and their book "Ant Colony Optimization". The implementation below uses the ACO approach to plot an optimal, shortest-distance path through the 51 capital cities of Europe.

Download the executable JAR

Download the project report