旅行商问题(TSP)是一个典型的组合优化问题，也是一个经典的NP难题-Traveling Salesman Problem (TSP) is a typical combinatorial optimization problem, but also a classic NP-hard

旅行商问题，常被称为旅行推销员问题，是指一名推销员要拜访多个地点时，如何找到在拜访每个地点一次后再回到起点的最短路径。规则虽然简单，但在地点数目增多后求解却极为复杂-Salesman problem, often referred to as the traveling salesman problem, refers to a salesman when you want to visit multiple locations, how to find the time to visit ea