ResearchBenchmarksTraveling Salesman Problem on TSPLIB LIB-L (501 ≤ n ≤ 1000)Traveling Salesman Problem on TSPLIB LIB-L (501 ≤ n ≤ 1000)Follow1.43Optimality GapASRO-EoH0.5666.39812.2318.062Jan 30, 2026Evaluation resultsMethodMethodLinksOptimality GapASRO-EoH2026.011.43EoH2026.013.4FI2026.0113.3NI2026.0123.03