List your company

Traveling Salesman Problem on TSPLIB N <= 1000

3.42Optimality Gap BeforeINViT-1V+ASAP w/ MAML
3.01725.73618.45511.1739Jan 29, 2025

Evaluation results

MethodLinks
INViT-1V+ASAP w/ MAMLBackbone=INViT-1V, Adaptation=ASAP, Algorithm=MAML2025.013.42—2.790.63
INViT-1V+ASAP w/o MAMLBackbone=INViT-1V, Adaptation=ASAP, Algorithm=None2025.013.95—3.020.93
INViT-1V+MAMLBackbone=INViT-1V, Adaptation=MAML2025.014.67—4.070.6
INViT-1VBackbone=INViT-1V, Adaptation=None2025.016.22—5.730.49
POMO+ASAP w/ MAMLBackbone=POMO, Adaptation=ASAP, Algorithm=MAML2025.019.43—7.721.71
POMO+MAMLBackbone=POMO, Adaptation=MAML2025.0110.11—9.120.99
POMO+ASAP w/o MAMLBackbone=POMO, Adaptation=ASAP, Algorithm=None2025.0110.37—8.781.59
POMOBackbone=POMO, Adaptation=None2025.0113.49—12.750.74
BQ greedyAvg.time=4.3s2024.05—3.04——
ELG aug×82024.05—2.98——
ICAMAvg.time=1.0s2024.05—5.95——
ICAM aug×8Avg.time=6.5s2024.05—4——
LEHD greedyAvg.time=4.4s2024.05—2.51——
POMO aug×8Avg.time=15.9s2024.05—9.31——