Traveling Salesman Problem Using Genetic Algorithm
Mohammad Asim, Ritika Gopalia, Shivalika Swar · 2014
Traveling salesman problem is quite known in the field of combinatorial optimization. Through this paper we describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. The purpose is to find the most approximate solution that gives us the least distance, which is the shortest route for traversing the cities given in the data set such that each city is passed through just once and the traveling salesman comes back to the initial city from where he started. We accomplish this by carrying out the algorithm through generating a fitness formula and with the help of genetic operators like selection, crossover and mutation.