ResearchBenchmarksPickup and Delivery Traveling Salesman Problem on PDTSP-101Follow9.428Objective ValueLKH9.397329.604419.811510.01859May 12, 2026Evaluation ResultsMethodMethodLinksObjective ValueOptimality GapLKHIterations=10k, Time=98mIterations=10k, Time=98m2026.059.4280HA-N2SIterations=3k, Time=3m...Iterations=3k, Time=3m, Backbone=N2S2026.059.7012.89N2SIterations=3k, Time=3mIterations=3k, Time=3m2026.059.8464.44DACTIterations=3k, Time=2.5mIterations=3k, Time=2.5m2026.0510.1958.13