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.
-
Notifications
You must be signed in to change notification settings - Fork 0
AhmedDiaa0212/Solving-the-TSP-using-a-genetic-algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A Genetic Algorithm project for solving The Traveling Salesman Problem "TSP"using Roulette Wheel Selection, Ordered Crossover (OX) and Mutation Swap Mutation
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published