Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T10:56:37.481Z Has data issue: false hasContentIssue false

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

Published online by Cambridge University Press:  20 August 2008

Tuomo Valkonen
Affiliation:
Department of Mathematical Information Technology, University of Jyväskylä, Jyväskylä, Finland. tujumava@jyu.fi; tka@mit.jyu.fi
Tommi Kärkkäinen
Affiliation:
Department of Mathematical Information Technology, University of Jyväskylä, Jyväskylä, Finland. tujumava@jyu.fi; tka@mit.jyu.fi
Get access

Abstract

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.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable