A new approach to solve travelling salesman problem

Abstract

The travelling Salesman Problem is one of the most NP-hard problems. Our research provides a yieldable method for solving the problem using genetic algorithm. To solve TSP we use genetic algorithm, a search algorithm which generates random tours and using crossover technique it gives almost optimized solution for for these kinds of problems. We are introducing a map reduction technique with Genetic Algorithm to create a new approach to solve TSP.