旅行商问题：一个旅行者要去很多城市，每个城市只去一次，问：该怎么走路线最短？
?
?????? 这个问题可以转化为：随机给n个点，如何连线这n个点，使得连线最短？
?
?????? 这个问题是遗传算法的经典问题~哈哈~~我试着写了一个程序来解决。
?
?????? 采用的策略是：
1.?????? 精英主义：每次有2个最优解直接进入下一代。
2.?????? 轮盘赌选择生育：每次对每一代的个体进行一次轮询，如果不适应度<某个随机数，那么选择这个个体进行生育。
3.?????? 单性繁殖：因为基因组的基因是互斥的且有序的，所以不适合两性繁殖。
4.?????? 交换变异：变异的方式为——随机选择两个不同位置的基因，交换位置。(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.)