用遗传算法求解旅行商问题，程序中的数据采用的是马少平，朱小燕编写的人工智能P298中的10城市的数据，运行的结果和书上给出的最优解一致，由于程序中群体规模设置的较大，程序运行时间可能需要7s左右。另外初始群体的生成是采用的排列组合算法，有兴趣的读者可以研究此算法的原理或共同探讨-A Genetic Algorithm for Traveling Salesman Problem, program data is in Ma Siu-ping, Xiao-Yan Zhu artificial intelligence preparation of P298 in 10 cities in the data, run results and the optimal solution given the book the same, because of the population size is set larger, the program may need to run-time of about 7s. Another generation of initial population is used in permutations and combinations algorithm, interested readers can study the principles of this algorithm, or to discuss