Review of Traveling Salesman Problem for the genetic algorithms

Genetic Algorithms (GAs) are an evolutionary technique that uses the operators like mutation, crossover and the selection of the most fitted element as solution for problems optimization. The Traveling Salesman Problem (TSP) finds a path with minimal length, closed within a weighted graph in all its nodes and it visits each of them once. This problem is found in many real world applications and where a good solution might help. There are applied many methods for finding a solution for the TSP, but during this study GAs are used as an approximate method of TSP