Genetic algorithm applied to TSP

This code implements a genetic algorithm-based solver for the Traveling Salesman Problem (TSP). It starts by setting parameters such as the

This code implements a genetic algorithm-based solver for the Traveling Salesman Problem (TSP). It starts by setting parameters such as the number of cities, the number of generations, population size, mutation rate, and crossover rate. Then, it generates initial city coordinates and population. In each generation, it calculates the fitness of the population, selects the best route, performs selection, crossover, and mutation operations, and updates the population. Finally, it plots the best route. The entire process iteratively optimizes through a genetic algorithm to find the shortest path.