基于改进的节约里程法的TSP问题研究

Study on Improved Saving Algorithm for TSP

针对现状对节约里程法进行改进,将节约里程法的最终解作为禁忌搜索算法的初始解来进一步求解最优路径,并通过求解将物流运输路径问题简化成TSP问题进行实例论证,最终用C语言编程实现。结果显示,改进的节约里程法更合理的优化了物流配送路径,实现了更优路径的选取。

In this paper, we took the final solution of the saving algorithm as the initial solution of the tabu search algorithm and then simplified the transportation routing problem into a traveling salesperson problem. After realizing the problem using C langauge, we found that the algorithm could more reasonably optimize distribution route.