What is the Traveling Salesman Problem?

The traveling salesman problem, that is, the TSP problem (Traveling Salesman Problem), is translated into the traveling salesman problem and the freighter problem, which is one of the well-known problems in the field of mathematics. Suppose a travelling businessman wants to visit n cities, he must choose the path to be taken. The restriction of the path is that each city can only visit once, and finally return to the original city of departure. The goal of the route selection is that the required route distance is the smallest value among all routes.

The TSP problem is a combinatorial optimization problem. This problem can prove to have NPC computational complexity. Therefore, any method that can simplify the solution of this problem will receive high evaluation and attention.

A businessman wants to visit some cities in China and asks:

1. The distance travelled is the closest;

Another: TSP telecommunication service provider;

Another: tsp total suspended particulate matter.

Total suspended particulate matter refers to particulate matter that can be suspended in air with an aerodynamic equivalent diameter 100 microns. Called TSP, it is a common important pollution index in the evaluation of atmospheric quality. The concentration of total suspended particulate matter is expressed in milligrams of total suspended particulate matter per cubic meter of air. A standard large-capacity particle sampler is used to collect a known volume of particulate matter on a filter membrane with a sampling efficiency close to 100%. Under constant temperature and humidity conditions, weigh The quality of the collected particulate matter is determined by sampling the film mass before and after sampling, and then divided by the sampling volume to obtain the mass concentration of the particulate matter.