Solving the travelling salesman problem using a genetic algorithm.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitattributes
.gitignore
LICENSE
README.md
tsp_ga.py
visualisation.py

README.md

Solving the travelling salesman problem using a genetic algorithm

My high school project from a few years back. I tried to solve the travelling salesman problem (i.e. find the shortest route between a number of cities where you only visit each city once and return to the city of departure) using a genetic algorithm. Genetic algorithms are a heuristic inspired by evolution that is very useful for this kind of problem with a very large solution space.

Screenshot