Applying Improved Genetic Algorithm to Solve Travelling Salesman Problem

Travelling Salesman Problem is a very popular problem in graph theory and it is applicable to solve many problems of science and engineering. It has its applications in electronics, transportation, navigation, computer networks etc. As the number of cities increases the complexity of the algorithm to find the optimal solution increases. TSP is a maximization optimization problem. In this paper genetic algorithm is used to solve TSP problem. Genetic Algorithm is a nature inspired algorithm which is very suitable to solve optimization problems. An improved genetic algorithm is proposed and applied on standards TSP instances. The achieved results are found better as compared to other recent research works in this area.