Travelling salesman problem solution - Genetic algorithm

Solution to TSP with a genetic algorithm.
Amount of points/genes: 60
Initial population : 400
Chromosomes generated as new generation: 200
Amount of best chromosomes selected for breeding: 40
Generations: Clip1 519, Clip2 467

In addition to basic genetic algorithm, I added some submutations within chromosome crossover process. Also out of 40 chromosomes, that were selected for breeding, the 10 best ones were overwritten by globally best chromosome. This increased the chances of getting the genes of a best chromosome + genetic diversity from the leftover weaker chromosomes.