An original algorithm for the Euclidean version of the Traveling Salesman Problem (ETSP), utilizing the midpoint of the edges of the convex hull.