基于禁忌搜索算法的旅行售货员问题

The Solution of Trip Sales Clerk Problem Based on Taboo Search Algorithm

旅行售货员问题(TSP)是组合路径问题,属于NP问题,对于这个问题的解决已经提出了很多的算法.本文基于禁忌搜索算法思想对TSP问题进行了探讨.在此基础上,通过相应的路径搜索变换,找出一个近似最优解.

TSP is a combination problem, which belongs to the problem of NP. There have been many ways to solve this problem. This article carries on the study to the problem of TSP based on the taboo search. Accordingly, a superior solution can be found through the homologous path manhunt transformation.