Evaluation of TSP using ANT Colony Optimization and Genetic Algorithm and Heuristics Algorithm and their Comparison
The Travelling Salesman Problem (TSP) is a very popular combinatorial optimization problem of real world. In this paper the objective is to find out a shortest possible path travelled by a salesman while visiting every city once and returned to the origin city. In this paper three optimization techniques are presented such as ant colony optimization (ACO), genetic algorithm (GA), and evaluation has been done for all these 3 algorithm to solve tsp.
Keywords - The Travelling Salesman Problem, Ant Colony Optimization, Genetic Algorithm, Nearest Neighbour Algorithm.