The Travelling salesman problem also popularly known as the TSP, which is the most classical combinatorial optimization problem. It is the most diligently read and an NP hard problem in the field of optimization. When the less number of cities is present, TSP is solved very easily but as the number of cities increases it gets more and more harder to figure out. This is due to a large amount of computation time is required. So in order to solve such large sized problems which contain millions of cities to traverse, various soft computing techniques can be used. In this paper, we discuss the use of different soft computing techniques like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and etc. to solve TSP.
Vector ANT Colony Optimization and Travelling Salesman Problem
