Introduction - If you have any usage issues, please Google them yourself
Traveling salesman problem: a traveler is going to many cities, each city only once, ask: how to go, the shortest route?
This problem can be transformed into random to n points, how to connect the n points, the shortest line?
This problem is a classic problem of genetic algorithm ~ ha ha ~ ~ I try to write a program to solve.
Strategy is used:
1. elitism: every time there are 2 optimal solution directly into the next generation.
2. Roulette: every time a family of polling each generation of individuals, if not to "a random number, then the individual choice of fertility.
3. parthenogenesis: because genes are mutually exclusive and orderly, so it is not suitable for sexual reproduction.
4. exchange variation way -- random selection of two different positions of the gene exchange position.