中文说明：旅行商问题（TSP）询问以下问题：由于城市的名单，每对城市之间的距离，那是什么访问每个城市恰好一次，并返回到出发城市的最短路线。它是组合优化的NP难问题，在运营研究和理论计算机科学的重要。我们使用蚁群算法使用这个问题，因为输入一些基准，计算城市之间的距离的使用蚂蚁作为平行于构建解决方案，这将是城市之间的最短路径解决这个问题。
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. It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.we solve this problem