🗺️ Travelling Salesman Problem (TSP) using Genetic Algorithm This project uses a genetic algorithm to find a near-optimal route that visits all cities exactly once and returns to the starting point. 📊 Output The algorithm visualizes the shortest path after several generations.