Abstract: In this paper a geometrical algorithm for solving TSP is presented. The algorithm requires O（） comparisons and O（） multiplications, in which n, m are the number of the given points and the number of the vertex of the convex hull respectively.