遗传算法TSP，旅行商问题，1．　　假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求所经过的路径路程尽量短。-Genetic algorithm TSP, Traveling Salesman Problem, 1. Suppose you have a traveling businessman to visit n cities, he must choose the path to go, a restricted path is visit each city only once, and the last to return to the original departure city. Select the destination path is the path　requirements as short as possible.