We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problemformulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt tofind local approximate solutions to the Euclidean TSP.