Because I posted a link "Cows Win the World" in the answer of another account, which was blocked by Baidu, I can only use this account to answer the landlord's question again.

First of all, this problem is not a location problem;

Secondly, this problem is the Multi-Traveling Salesman Problem (MTSP), that is, multiple traveling salesmen start from one city and go to all cities at the same time, and each city only visits once, and then returns to the starting point, with the goal of pursuing the shortest time, the shortest total distance or the lowest cost.

Thirdly, in view of the small scale of the problem proposed by the landlord, with only 24 points, the multi-traveling salesman problem can be transformed into a single traveling salesman problem and solved by branch and bound method.