中文摘要：

TSP 组合优化问题随着问题规模的增大，其潜在解的搜索空间增长速度比指数函数增加的速度还快．TSP问题的NP-hard使得求解这些问题的最优解非常困难．提出了通过改进经典遗传算法来求解TSP问题近似解的一个算法．仿真结果验证了该算法的有效性．

英文摘要：

TSP combinatorial optimization problem increases with the size of the problem,the growth rate of search space solutions for its potential is also faster than the exponential increase.The TSP NP-hard problem makes the optimal solution to solve this problem is very difficult.Gave a new algorithm to comput a realistic solution for TSP approximate by using of the genetic algorithm that improves classical genetic algorithm.The simulation results verified the effectiveness of the algorithm.