NathanaelTamirat/Ant-colony-optimization

Ant colony optimization (ACO) is a nature-inspired algorithm that can be used to solve the traveling salesman problem (TSP). The TSP is a combinatorial optimization problem that involves finding the shortest route between a set of cities, while visiting each city and returning to the starting city.

Java