Abstract: Drawing on the basic thinking of traditional greedy algorithms, this paper proposed a new verification algorithm for solving traveling salesman problems based on return-to-zero matrix This method takes the return-to-zero matrix as input to avoid matrix traps, the full greedy algorithm as the thought of problem solving to obtain the shortest Hamilton circuit. Using this method to solve some problems in TSP-LIB, the results show that this proposed method can obtain a better satisfactory solution within a shorter time.

Key words: Traveling salesman problem, Ureedy algorithm, Return-to-zero matrix