yiqunsuanfaTSP

代码说明：

说明：  利用蚁群算法解决TSP问题，本例涉及了31个城市并将其坐标化，每个城市只能拜访一次，而且最后要回到初始城市，所选路径为所有路径之中的最小值。(Using ant colony algorithm to solve TSP problem, this example involves 31 cities and coordinates them, each city can only visit once, and finally return to the initial City, the selected path is the minimum of all paths.)