Ant Colony Optimization (ACO) to solve traveling salesman problem (TSP)

This code presents a simple implementation of ACO to solve traveling ‎salesman problem (TSP)‎

This code presents a simple implementation of Ant Colony Optimization (ACO) to solve traveling ‎salesman problem (TSP). Given a list of cities and their pairwise distances, the task is to find a shortest ‎possible tour that visits each city exactly once. ‎