A Survey on Travelling Salesman Problem (TSP) to Improve the Distance between Cities by Using Ant Colony Algorithm

The travelling salesman problem (TSP) is a nondeterministic Polynomial hard problem in combinatorial optimization studied in theoretical computer science and operations research. And to solve this problem we used two popular meta-heuristics method that used for optimization techniques; the first one is Ant Colony Optimization (ACO), and the second is Genetic Algorithm (GA). In this work, we try to apply both techniques to solve TSP by using the same dataset and compare between them to determine the best one for travelling salesman problem.