With this code we try to find the shortest path can be set in a graph of N nodes starting from a node and ending in the same node passing through every node. Solution computed with a genetic algorithm on python. The function to call is travelers(Muestras,Niter,Prob_mut,Nodos,CiudadInicial) Where: Muestras is the number of population for the genetic algorithm Niter is the number of iterations Prob_mut is the probability of a mutation is taking place on each generation Cities is the number of cities InitialCity is the starting and final city
-
Notifications
You must be signed in to change notification settings - Fork 0
With this code we try to find the shortest path can be set in a graph of N nodes starting from a node and ending in the same node passing through every node. Solution computed with a genetic algorithm on python.
fabianhr21/Traveling-Sales-Man-Problem
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
With this code we try to find the shortest path can be set in a graph of N nodes starting from a node and ending in the same node passing through every node. Solution computed with a genetic algorithm on python.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published