Abstract:  In this paper, the concept of weighting distance matrix is presented. Then, method is given to calculate the weighting distance matrix. Based on this concept, a novel algorithm called matrixcircle intelligent algorithm is proposed to find an approximate solution of the traveling salesman problem. This algorithm finds a circuit by using the characteristics of the weighting distance matrix. This circuit is unremittingly improved and updated until a satisfied solution is found. A number of examples from the library of TSPLIB are used to test the proposed algorithm and results show that it is very effective.