Abstract: The Traveling Salesman problem is one of the very important problems in Computer Science and Operations Research. It is used to find the minimum cost of doing a work while covering the entire area or scope of the work in concern. In this paper we will review the past work done in solving the travelling salesman problem using three different techniques- genetic algorithm, ant colony optimization and artificial neural network

Keywords: Travelling Salesman Problem, Genetic Algorithm, Artificial Neural Network, Ant Colony Optimization.