20

The answer to the question is: No. (Although one can debate what exactly is a "metaheuristic") The "gold standard" for finding high quality feasible solutions for the TSP is the LKH (Lin-Kernighan-Helsgaun) heuristic described in this paper: K. Helsgaun (2000). "An Effective Implementation of the Lin-Kernighan Traveling Salesman ...


7

In no particular order ... I wouldn't call the objective function of the TSP "vague". It is quite explicit. The term "gradient-free" applies to algorithms, not to problems. You might find yourself choosing between gradient-based and "gradient-free" algorithms for the same problem. The confusion may arise from the fact that you ...


6

Take a look at the Concorde https://www.math.uwaterloo.ca/tsp/concorde.html. If it's a TSP problem, not a variant, Concorde can solve it and it is a beast. When you say "versions of the Travelling Salesman Problems where the number of cities are large", around what value are you refering to with "large"?


4

There's been a brilliant development in the Traveling Salesman problem recently leveraging neuromorphic computing. Essentially, neuromorphic chips contain a massive array of (often) physical neurons with dense local connections and some routing circuitry to transmit information to other arrays. In essence, each node or "city" is represented by a ...


Only top voted, non community-wiki answers of a minimum length are eligible