List your company

Traveling Salesman Problem on Euclidean TSP n=200 Uniform distribution in unit square (test)

10.67Tour LengthConcorde
10.416412.128213.8415.5518Jan 19, 2026

Evaluation results

MethodLinks
ConcordeType=Solver2026.0110.6701.18
GATType=RL, BS, Reference=Kool et al., 20182026.0111.386.142.7
GATType=RL, S, Reference=Kool et al., 20182026.0111.456.822.1
SCT-GNNType=GNN, UL, batch size=512, ensemble=dropout + snapshot2026.0111.558.2513.28
SCT-GNNType=GNN, UL, batch size=512, ensemble=snapshot (5)2026.0111.578.434.75
SCT-GNNType=GNN, UL, batch size=512, ensemble=dropout (10)2026.0111.578.439.48
GATType=RL, G, Reference=Kool et al., 20182026.0111.618.310.04
SCT-GNNType=GNN, UL, batch size=512, dropout=no MC dropout2026.0111.659.180.96
2-optType=Heuristic (C++)2026.0111.9211.725.99
ChristofidesType=Heuristic (networkx)2026.0112.0312.750.58
GATType=RL, S, Reference=Deudon et al., 20182026.0113.1722.912.27
Greedy Nearest-NeighborType=Heuristic (C++)2026.0113.4325.870.11
GCNType=SL, BS, Reference=Joshi et al., 20192026.0116.1951.022.17
GCNType=SL, G, Reference=Joshi et al., 20192026.0117.0158.730.46