基于最小调整法求解旅行商问题

The Least Adjustment Method in Traveling Salesman Problem

介绍了一种求解旅行商问题的新算法"最小调整法",给出了该算法求解旅行商问题的具体步骤以及有效性证明,对算法的复杂性及近似程度进行了分析.最后通过典型算例进行了检验说明.与经典算法相比,新算法体现了简单易行的特点,对求解旅行商问题具有一定的启发意义.

This paper introduced a new algorithm ＇the least adjustment method＇ for traveling salesman problem. The specific steps were given, the effectiveness of the algorithm was proved, and the complexity and the degree of approximation for the algorithm were analyzed. Finally, the typical examples were given to test and illustrate the algorithm. The algorithm is simple compared with the classic algorithms , and has instructive significance to traveling salesman problem.