Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Solve the travelling salesman problem using genetic algorithm
Python
branch: master
Failed to load latest commit information.
README.md s/contest/contests/
example_with_cycle.png Initial commit
example_without_cycle.png
tsp.py Initial commit

README.md

TSP.py

The TSP class solve the famous travelling 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!

Something went wrong with that request. Please try again.