A Geometrical Algorithm for Solving the Travelling Salesman Problem

A geometrical algorithm for solving TSP is presented.The algorithm requires O(n2/m)comparisons,O(n2)operations for calculating the distance between the points and the distance between the points and the lines and O(n3/m3)additive operations,in Which n,m are the numbers of the given points and the numbers of the vertices of the convex hull respectively.