Introduction - If you have any usage issues, please Google them yourself
Traveling salesman problem, the TSP problem (Traveling Salesman Problem) is a well-known field of mathematics one of the problems. Suppose there is a travel merchant n cities to be visited, he must select the path to go, passing the restriction is to visit each city only once, and the last to go back to the original departure city. Path Selection The objective is to get the path distance for the minimum value among all the paths. TSP problem is a combinatorial optimization problem. This problem can be shown to have NPC computational complexity. Therefore, any solution of the problem can be simplified method will be subject to a high degree of evaluation and attention.