改进的TSP算法求解供应链一对多配送问题

摘要

TSP problem, the issue of optimal route tourism, is one of the most known problems.Today, people apply the TSP to address the logistics industry to optimize transport routes and that has become a new trend.At present, there isn' t a simple and unified solution to the TSP problem.In this article, the author, through improving TSP algorithm, transforms TSP problem into the problem of solving the minimum spanning tree and the matching of suspension point in figures.In this way, it not only greatly reduces the search space of TSP solution and the difficulty of the solution, but also gains an improved method and solves one - to - many distribution problem.%TSP问题即旅游最优路线问题,是数学领域中著名问题之一.如今,把TSP用于解决物流行业中运输线路优化已成为一种新的趋向.针对TSP问题没有一种简便、统一的求解方法,提出了改进的TSP算法,即把问题转化为求解最小树和图中悬挂点的匹配问题,从而大大缩小了TSP问题解的搜索空间,降低了求解难度,得到一种改进的求解方法,解决了供应链一对多配送问题.