Solving the Travelling Salesman Problem Using the Ant Colony Optimization

In this article, we study a possibility of solving the well-known Travelling Salesman Problem (TSP), which ranges among NP-hard problems, and offer a theoretical overview of some methods used for solving this problem. We discuss the Ant Colony Optimization (ACO), which belongs to the group of evolutionary techniques and presents the approach used in the application of ACO to the TSP. We study the impact of some control parameters by implementing this algorithm. The quality of the solution is compared with the optimal solution.