关键词: 模拟退火, 禁忌搜索, 旅行商问题

Abstract: Based on the existing smiulated annealing algorithm，the paper proposes a hybrid tabu-smiulated approach which introducing a new cooling schedule to solve Traveling Salesman Problem.With this new temperature control scheme，a higher chance of an uphill move is given at the end of search.Combined with the excellent local search ability of tabu search and the fine solution quality of simulated annealing，the proposed approach is less dependent on the specific information of problem compared with conventional simulated annealing.The performance of proposed approach is evaluated and favorably compared with the conventional simulated annealing.Numerical results of Benchmark TSPLib illustrate that this algorithm has better convergence speed and easy to find out the best answer.

Key words: smiulated annealing algorithm, tabu search, Traveling Salesman Problem（TSP）