旅行商问题（TSP）是组合优化领域的一个典型的、易于描述却难以处理的NP完全难题，其可能的路径数目与城市数目是呈指数型增长的，求解非常困难。-Traveling Salesman Problem (TSP) is the field of combinatorial optimization of a typical, easy to describe but difficult to deal with NP-complete problems, the number of possible