Genetic Algorithm Solving the Traveling Salesman Problem - 50 Cities

Genetic Algorithm (GA) solving the Traveling Salesman Problem with a world size of 50 cities. The GA used a roulette wheel selection scheme, a single point crossover method, and a single swap mutation method. The code was written in C++ and CUDA.