There are n cities known to be related to the TSP problem. Now a promoter needs to visit n cities. For each city, he only needs to visit once and finally return to the starting city. Please arrange the order of visits to make the general route faster. TSP is a typical combinatorial optimization problem.

Advantages and disadvantages of NP-hard problem and standard problem of measurement algorithm.

The problem of traveling salesman is that there are n known cities, and an existing salesman has to visit these n cities, and each city can only visit once, and finally he has to return to the starting city. It is necessary to arrange the order of their visits to make the total length of their travel routes the shortest. TSP is one of the classic NP-hard combinatorial optimization problems, and it is also a standard problem to test the advantages and disadvantages of the algorithm.

Reward points will be confiscated soon.