这是一个模拟退火的智能算法，用来解决TSP问题及其衍生问题。-Above using a simulated annealing intelligent algorithms that can solve TSP problem and its derivatives.

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

基禁忌搜索于31城市TSP问题,Base tabu search in the 31 city TSP problem(Base tabu search in the 31 city TSP problem)