• Dr . laba kumar Thakuria
• Manabjyoti Choudhury

In this paper we have presented a solution for the travelling salesman problem using genetic algorithm. The solution provides a maximal approximation of the problem along with cost reduction. The solution also presents a method to find the nearly optimized solution for these types of optimization problems using a new crossover technique that produces a high quality solution to the TSP. Later, the paper presents a comparison of the effectiveness of the crossover operator with some traditional crossover operators.

Travelling Salesman Problem, Genetic Algorithm, Selection, Mutation, Crossover.

"An Approach to the Travelling Salesman Problem using Genetic Algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.307-312, June-2019, Available :http://www.jetir.org/papers/JETIR1908B42.pdf

"An Approach to the Travelling Salesman Problem using Genetic Algorithm", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp307-312, June-2019, Available at : http://www.jetir.org/papers/JETIR1908B42.pdf