Improved Genetic Algorithm to Solve Small Scale Travelling Salesman Problem

Genetic Algorithms are the best solution to solve NP-Hard problem. Travelling Salesman Problem (TSP) is one of them which can be solved by GA. TSP Algorithm takes more time to find results when the number of cities increases. TSP problem has many applications in science and engineering. Genetic Algorithm GA is a technique used to find the solution of large scale TSP problems in a reasonable time. In this paper, an improved genetic algorithm is proposed that can be used to find the solution of TSP problems. After implementing this algorithm, found that the proposed algorithm finds better solutions of some instances of TSP problems as compared to other existing algorithms. It’s applied on standard TSP instances BAYG29, EIL51 and EIL76 and it found the better result of these type of NP-Hard problems