通过结合模拟退火算法与禁忌搜索算法的优点,提出一个组合算法,并将其应用到旅行商问题(TSP)中。并用C++实现一般的模拟退火算法和这种组合的模拟退火算法.比较结果显示出这种组合算法可以得到更好的结果。%Presents a hybrid algorithm of taboo search (TS) and simulated annealing(SA), which has the advantages of both taboo search and simulated annealing. Applies the hybrid algorithm in solving the travelling salesman problem(TSP) in C++ language. The experimental result shows that this hybrid algorithm can get the better result.
展开▼