蚁群算法源程序：求31个城市的最短路径的程序！（TSP）-Ant Colony source: 31 cities seeking the shortest path program! (TSP)

TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.

蚁群算法解决TSP问题。通过蚁群算法解决一个城市的结合以及城市之间的旅行代价，寻找经过每个城市一次且仅一次而最终返回的旅行最小代价，及寻找最短路径。-Ant colony algorithm to solve TSP problem. Through the combination of ant colony algorithm to solve a city and cost of travel between cities, seeking after each city once and

此程序为TSP问题的遗传算法，程序可以完美运行，计算最短路径。(This procedure for the TSP problem by genetic algorithm, the program can run perfectly, the shortest path calculation.)