Ant colony algorithm to solve the travelling salesman problem (TSP):
"Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" — From Wikipedia
Use the following command in the command window to run the algorithm:
run("src/main")