应用遗传算法解决旅行商（TSP）问题，算法中的染色体交叉过程改进了基本遗传算法的交叉办法。改程序可以求解30个城市的旅行商问题，也可以稍作修改继续扩展为更多城市的旅行商问题。-Applying the genetic algorithm to solve the traveling salesman (TSP) problem, the algorithm improves the process of chromosomal crossover compared to traditional crossover approach. It can solve the traveling salesman problem in 30 cities and also can be slightly modified to continue to expand to more cities in the traveling salesman problem.