Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Department of Mathematical Information Technology,
University of Jyväskylä, Jyväskylä, Finland.
We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP.
Mathematics Subject Classification: 90C26 / 90C59 / 90C27
Key words: Euclidean TSP / clustering / diff-convex / Weiszfeld algorithm
© EDP Sciences, SMAI, 2008