ResearchBenchmarksPickup and Delivery Traveling Salesman Problem on PDTSP-21Follow4.563Objective ValueLKH4.562924.563464.5644.56454May 12, 2026Evaluation ResultsMethodMethodLinksObjective ValueOptimality GapLKHIterations=10k, Time=5mIterations=10k, Time=5m2026.054.5630DACTIterations=3k, Time=1mIterations=3k, Time=1m2026.054.5643HA-N2SIterations=3k, Time=1m...Iterations=3k, Time=1m, Backbone=N2S2026.054.5643N2SIterations=3k, Time=1mIterations=3k, Time=1m2026.054.5655