Traveling Salesman Problem on TSPLib >1K
7.67Optimality Gap (Before)INViT-1V+ASAP w/ MAML
Evaluation Results
| Method | Links | ||||
|---|---|---|---|---|---|
| INViT-1V+ASAP w/ MAMLBackbone=INViT-1V, Adaptation=ASAP, Algorithm=MAML2025.01 | 7.67 | — | 6.98 | 0.69 | |
| INViT-1V+ASAP w/o MAMLBackbone=INViT-1V, Adaptation=ASAP, Algorithm=None2025.01 | 8.36 | — | 7.41 | 0.95 | |
| INViT-1V+MAMLBackbone=INViT-1V, Adaptation=MAML2025.01 | 9.75 | — | 9.1 | 0.65 | |
| INViT-1VBackbone=INViT-1V, Adaptation=None2025.01 | 10.33 | — | 9.77 | 0.56 | |
| POMO+ASAP w/ MAMLBackbone=POMO, Adaptation=ASAP, Algorithm=MAML2025.01 | 47.45 | — | 40.13 | 7.32 | |
| POMO+ASAP w/o MAMLBackbone=POMO, Adaptation=ASAP, Algorithm=None2025.01 | 51.25 | — | 44.53 | 6.72 | |
| POMO+MAMLBackbone=POMO, Adaptation=MAML2025.01 | 53.21 | — | 49.28 | 3.93 | |
| POMOBackbone=POMO, Adaptation=None2025.01 | 60.05 | — | 71.22 | -11.17 | |
| LEHDDecoding Strategy=greedy2026.05 | — | 13.913 | — | — | |
| MnLPDecoding Strategy=greedy2026.05 | — | 12.252 | — | — | |
| POMODecoding Strategy=aug x 82026.05 | — | 63.81 | — | — |