【摘要】 本文提出了一种基于禁忌表的定位算法求解TSP问题的快速、高效近似算法。这种算法结合了禁忌搜索算法中禁忌表及大规模构造算法和定位改进算法求解规模较大的TSP问题。计算机实例仿真证明,算法在求解质量和求解速度两方面高于著名的启发式算法的解。该算法针对TSP问题提出,是非常有效的。更多还原

【Abstract】 This paper proposes a fast and effective approximate algorithm—position-fixed based on tabu list algorithm, Which incorporates the tabu list in tabu search algorithm,SizeScale-construction algorithm and position-fixed improve- ment algorithm to solve the large-scale traveling salesman problem.Position-fixed based on tabu list algorithm is spe- cially devised for TSP,the experimental results show that the algorithm outperforms the known best ones inquality of solution and running speed compared to the famous heuristic algorithm.更多还原