中文说明：旅行商问题（TSP）提出了以下问题：给定一个城市列表和每对城市之间的距离，哪条最短的路线可以精确地访问每个城市一次并返回出发城市
English Description：
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city