Skip to content

🗺 A genetic algorithm to find the shortest path for coordinates on a cartesian plane - solution to the Traveling Salesman

License

Notifications You must be signed in to change notification settings

karipov/genetic-salesman

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Genetic Algorithm applied to the Traveling Salesman Problem

Binder GitHub

Evolution

paper.ipynb notebook has all the explanations regarding Genetic Algorithms and how they are used to solve the Traveling Salesman Problem.

src/genetic.py file works as a library with the Points, Route and Population classes available to import in other files (such as the jupyter notebook above).

Preferred run method

It is not recommended to run the algorithm within the jupyter notebook for performance and other visual reasons (just doesn't look nice).

On the binder, the plots, instead of updating, simply appear one under the the other. Please allow up to 5 minutes for the binder server to launch.

On your own machine, when running in the CLI, please ensure that that you remove jupyter=True and pass in animate=True for the plotting function.

About

🗺 A genetic algorithm to find the shortest path for coordinates on a cartesian plane - solution to the Traveling Salesman

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published