Answers are grounded in this paper and cite their sources.
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided.
No takes yet. Share an insight, caveat, or question.
A 2009 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: