Traveling Salesman Problem on Euclidean TSP N=50
5.69Optimal Tour LengthOracle (Concorde)
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Oracle (Concorde)2022.06 | 5.69 | 0 | |
| ConcordeType=EXACT2023.02 | 5.69 | 0 | |
| TransformerType=2kxSAMPLING2023.02 | 5.69 | 0 | |
| POMOType=8x AUGMENT2023.02 | 5.69 | 0.03 | |
| DIFUSCOType=16xSAMPLING2023.02 | 5.69 | -0.01 | |
| DPDPType=1k-IMPROVEMENTS2023.02 | 5.7 | 0.14 | |
| DIFUSCOType=GREEDY2023.02 | 5.7 | 0.1 | |
| GCNType=2kxSAMPLING2023.02 | 5.7 | 0.01 | |
| MDAMType=50xSAMPLING2023.02 | 5.7 | 0.03 | |
| DPDPType=100k-IMPROVEMENTS2023.02 | 5.7 | 0 | |
| Transformer (Deudon et al.)2022.06 | 5.71 | 0.31 | |
| TransformerType=GREEDY2023.02 | 5.71 | 0.31 | |
| POMOType=GREEDY2023.02 | 5.73 | 0.64 | |
| AMType=1kxSAMPLING2023.02 | 5.73 | 0.52 | |
| Diffusion 20-50trained_on=20-50 nodes2022.06 | 5.76 | 1.23 | |
| Image DiffusionType=GREEDY2023.02 | 5.76 | 1.23 | |
| Diffusion 50trained_on=50 nodes, inference_steps=2562022.06 | 5.763 | 1.28 | |
| Diffusion 50trained_on=50 nodes, inference_steps=642022.06 | 5.78 | 2.6 | |
| Transformer (Kool et al.)2022.06 | 5.8 | 1.76 | |
| AMType=GREEDY2023.02 | 5.8 | 1.76 | |
| Diffusion 50trained_on=50 nodes, inference_steps=42022.06 | 5.851 | 2.86 | |
| Diffusion 50trained_on=50 nodes, inference_steps=162022.06 | 5.858 | 2.98 | |
| 2-opt2022.06 | 5.86 | 2.95 | |
| 2-OptType=HEURISTICS2023.02 | 5.86 | 2.95 | |
| GNN2022.06 | 5.87 | 3.1 | |
| GCNType=GREEDY2023.02 | 5.87 | 3.1 |