旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case of the vehicle routing scheduling Problem (VRP), due to the mathematician has proved the TSP Problem is NP Problem, therefore, the VRP also belongs to the NP problems.Traveling salesman problem (TSP) is translated into traveling salesman problem, traveling salesman problem, referred to as the TSP problem, is the most basic route problem, the problem is looking for single travelers from the starting point, through all of the requirements of a given point, after the final path back to the origin of the minimum cost)