List your company

Traveling Salesman Problem on Uniform Euclidean TSP n = 500

12Execution Time (s)LKH3
-138.1764875.51431,889.2052,902.8957Dec 18, 2024Mar 7, 2025May 25, 2025Aug 13, 2025Oct 31, 2025Jan 18, 2026Apr 8, 2026

Evaluation results

MethodLinks
LKH3Type=Heuristic2024.1212—0
LEHDMode=Single forward pass2026.0413.0916.8084—
2-optType=Heuristic2024.1236—13
ICAM aug.Type=RL, sampling size=82024.1236—0.77
2opt Local SearchBudget=10n improvement steps2026.0437.5318.2049—
DIFUSCOType=SL+G+2-opt2024.1245—1.6
BQ-NCOType=RL2024.1254—1.2
T2TCOType=SL+G+2-opt2024.1254—0.85
ICAMType=RL2024.1260—1.6
POMOType=RL + S, sampling size=82024.1266—22
NICOBudget=10n improvement steps2026.0477.1117.0113—
IDEQType=SL+G+2-opt2024.1278—0.41
T2TCOType=SL+S+2-opt, sampling size=42024.1290—0.67
GLOPType=RL2024.1296—2.2
LEHD + NICOBudget=10n improvement steps2026.04139.8416.764—
ConcordeType=Exact2024.12156—0
DIFUSCOType=SL+S+2-opt, sampling size=42024.12156—0.93
UTSPType=UL + MCTS2024.12162—0.8
IDEQType=SL+S+2-opt, sampling size=42024.12222—0.29
2opt-DRLBudget=10n improvement steps2026.04224.6318.5447—
Tabu SearchBudget=10n improvement steps2026.04307.9417.9746—
NICORestarts=8, Budget=10n improvement steps2026.04557.6216.8676—
LEHD + NICORestarts=8, Budget=10n improvement steps2026.04569.0416.6817—
GAT-ImprovBudget=10n improvement steps2026.04752.33235.2172—
NeuOptBudget=10n improvement steps2026.04827.41130.9429—
BQ-NCOType=RL +BS, beam search size=162024.12900—0.55
DACTBudget=10n improvement steps2026.041,339.92164.9038—
NICORestarts=32, Budget=10n improvement steps2026.043,040.8416.7976—
LEHD + NICORestarts=32, Budget=10n improvement steps2026.043,050.1216.6794—
3opt Local SearchBudget=10n improvement steps2026.043,766.4117.5621—
Optimum2026.04—16.5396—