Answers are grounded in this paper and cite their sources.
This article describes a new composite heuristic for the symmetric Traveling Salesman Problem. The heuristic consists of three phases: construction of an initial envelope, insertion of the remaining vertices, and improvement procedure. The heuristic is shown to perform very well both on randomly generated instances and on TSPLIB problems.
No takes yet. Share an insight, caveat, or question.
Renaud et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: