旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短-TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], where dij that city i to city j the distance, i, j = 1, 2 ... n, then the problem is to find out I visited each city exactly once and make a loop for the shortest path length