基于禁忌搜索的求解TSP问题。问题为31个城市的寻优路径，采用GLover提出的简单禁忌搜索算法。设置禁忌表，避免陷入循环，实现全局的最优。-Based on Tabu Search for TSP. Route optimization problem in 31 cities, using a simple tabu search algorithm GLover proposed. Set tabu list, to avoid falling into circulation, to achieve global optimum.