Aiming at the problem that the traditional Hungarian algorithm will lead to multi-loop closure when solving the Travelling Salesman Problem (TSP), a breaking mechanism is proposed, and a Hungarian algorithm for breaking the loop is designed. By using the description method of assignment problem to model the traveling salesman problem and establish the transformation relationship between the two, it is demonstrated that the sufficient necessary condition for the feasible solution of the TSP problem is that the feasible solution of the corresponding allocation problem is combined with the auxiliary edge and only contains a loop, and six standard travel agents are tested and compared to verify the effectiveness of the algorithm. Experimental results show that the improved Hungarian algorithm can effectively solve the solution of TSP problem in different datasets.