This code uses the genetic algorithm to solve the traveling salesman problem by using the exchange,cross and mutation operators to change the route and calculate the fitness(distance) of each route.