To repeat it, there are cities and given distances between them. Travelling salesman has to visit all of them, but he does not to travel very much.
Task is to find a sequence of cities to minimize travelled distance.
In other words, find a minimal Hamiltonian tour in a complete graph of N nodes. Implementation Population of 16 chromosomes is used. Note that after adding and deleting city it is necessary to create new chromosomes and restart whole genetic algorithm. You can select crossover and mutation type. I will describe what they mean.