Solve the traveling salesman problem using genetic algorithm
Python
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
README.md
example_with_cycle.png
example_without_cycle.png
tsp.py

README.md

TSP.py

The TSP class solve the famous traveling salesman problem using a genetic algorithm. It use contests to select fathers/mothers and not a wheel roulette.

The code is documented so I think it's pretty easy to understand how it work, if you have a question ask!

Examples

Salesman with a cycle Salesman without a cycle

License

Do whatever you want with this!