Travelling salesman with genetic algorithms
Description:
GeneticTsp
is an implementation of a genetic algorithm for solving the travelling
salesman problem (tsp).
The tsp is a well known example for a so called np-hard problem. This means that it can't be solved within polynomical time O(n^m) but show a fuculty growing O(n!), when solved exactly.
For that reason, a heuristic solution was choosen. There are multiple ways of solving the tsp: genetic ~, linear search ~ and hybrid algorithms, for example.
This implementation is based on pure genetic algorithms. It doesn't raise a claim to be the fasted solution. Focus of the project is the theory behind and visualization of the evolutionary process.
Screenshot:
The tsp is a well known example for a so called np-hard problem. This means that it can't be solved within polynomical time O(n^m) but show a fuculty growing O(n!), when solved exactly.
For that reason, a heuristic solution was choosen. There are multiple ways of solving the tsp: genetic ~, linear search ~ and hybrid algorithms, for example.
This implementation is based on pure genetic algorithms. It doesn't raise a claim to be the fasted solution. Focus of the project is the theory behind and visualization of the evolutionary process.
Screenshot:
