我应该采用哪种TSP启发式算法？

Question

There are huge amount of papers related to TSP heuristic algorithm and each of them might focus on different kinds of TSP problem. Could anyone recommend several well performed TSP heuristic algorithms under the property described as follow: The "city size" of the TSP problem is equal to 30.

Answer 1

禁忌搜索，模拟退火和逾期接受我的所有工作做好， 例如 。

Answer 2

A space filling curve can solve it very fast. Then you can use k-opt or something to improve the edges. There is also the Ant Colony Optimization for example Gebweb tsp solver. It has also brute force and dynamic solution.

Answer 3

If the travelling salesman is metric (respects triangle inequality) than you might consider to use approximation algorithms that are polynomial and will always return a solution, which is at most X time worse than the optimal one. For example Christofides algorithm guarantees that the path will be at most 1.5 longer than the optimal one.