Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

Solve the travelling salesman problem using genetic algorithm

branch: master

Fetching latest commit…

Octocat-spinner-32-eaf2f5

Cannot retrieve the latest commit at this time

Octocat-spinner-32 README.md
Octocat-spinner-32 example_with_cycle.png
Octocat-spinner-32 example_without_cycle.png
Octocat-spinner-32 tsp.py
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 cycleSalesman without a cycle

License

Do whatever you want with this!

Something went wrong with that request. Please try again.