Ant Colony Optimiztion (ACO)

This is a simple implementation of the Ant Colony Optimization (ACO) to solve combinatorial optimization problems.

This is a simple implementation of the Ant Colony Optimization (ACO) to solve combinatorial optimization problems. Travelling Salesman Problem (TSP) is solved as an example. The results are also visualized to better observe the performance of ACO.

% To watch videos on this algorithm use this link: https://www.udemy.com/antcolonyoptimization/?couponCode=MATHWORKS_ACO