A perspective view on Travelling Salesman Problem using genetic algorithm

The travelling salesman problem (TSP) is one of the extensively studied optimization problem. The numerous direct applications of the TSP bring life to the research area and help to direct future work. To solve this problem many techniques have been developed. Genetic algorithm is one among those which solves this problem by using the processes observed in natural evolution to solve various optimizations and search problems. This paper presents a complete survey on genetic algorithm techniques proposed by researchers for solving travelling salesman problem.