旅行推销商问题(TSP)是组合优化中的一个热点问题，它有着广泛的应用背景。运输调度、机械手运动、旅游路线设计等众多实际问题与TSP数学模型密切相关.应用遗传算法求解TSP问题。-Traveling salesman problem (TSP) is a combinatorial optimization problem in a hotspot, it has a wide application background. Numerous practical problems of transport scheduling, robotic sports, travel routes design and TSP mathematical model is closely related to the application of genetic algorithm for TSP.