用分布式优化算法（EDA）的概率思想解决tsp问题。其中概率矩阵用（EHM）模型建立。里面有具体注释。(using EDA solve the TSP)

利用模拟退火算法进行仿真实验，解决TSP问题(Using simulated annealing algorithm to solve TSP)

带精英策略的蚂蚁算法，针对TSP问题做了研究(Ant Colony Algorithm for Traveling Salesman Problem)

用遗传算法实现旅行商问题，可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.)

利用蚁群算法、遗传算法还有改进的蚁群算法来解决TSP问题，根据需要可以选择TSP的规模，分别有31个城市的和48个城市的。(Using ants colony algorithm, genetic algorithm and improved ant colony algorithm to solve the TSP problem, we can choose the scale of TSP according to the needs, there are 31 cities and 48