This project employs a genetic algorithm to solve The Traveling Salesman Problem "TSP", which is the task of finding the shortest route that passes through a given set of cities. The algorithm initializes a population of candidate solutions and improves them through selection, crossover, and mutation operations to obtain better solutions.
ahmeddiaa0212 / solving-the-tsp-using-a-genetic-algorithm Goto Github PK
View Code? Open in Web Editor NEWA Genetic Algorithm project for solving The Traveling Salesman Problem "TSP"using Roulette Wheel Selection, Ordered Crossover (OX) and Mutation Swap Mutation