Genetic Algorithms with Traveling Salesman Problem
This project uses genetic algorithms to solve the traveling salesman problem (TSP), which is finding the shortest route for visiting a set of cities. The project also shows a graph of the optimal route.
