Applying Innovative Mutation Operation for Solving TSP Problem

Abstract

Travelling Salesman Problem TSP has many application areas in science and engineering. It is a well known NP-Hard problem. Many researchers solves TSP problem using nature inspired algorithms. Genetic algorithm is very popular among these algorithms. In this paper a new innovative genetic algorithm is proposed to solve TSP problem. The proposed genetic algorithm uses advanced genetic operators to solve TSP problem. The proposed algorithm is applied on some instances of TSP problem taken from TSPLIB repository and its results are found better.