This project uses a Genetic Algorithm to find near-optimal solutions to the Traveling Salesman Problem (TSP). Users can visualize the evolving routes and compare them to the optimal solution found using Bruteforce.
You can explore the live version of the project by visiting https://tspwga-simulation.onrender.com
This simulator comes with certain limitations and potential areas for improvement. Feel free to contribute to enhance its performance and capabilities.