NICO-TSP learns a 2-opt local search policy for TSP using edge tokens, imitation learning on short trajectories, and critic-free group RL on longer rollouts, yielding more step-efficient improvement and better out-of-distribution generalization than prior neural and heuristic baselines.
Neural large neighborhood search for the capacitated vehicle routing problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem
NICO-TSP learns a 2-opt local search policy for TSP using edge tokens, imitation learning on short trajectories, and critic-free group RL on longer rollouts, yielding more step-efficient improvement and better out-of-distribution generalization than prior neural and heuristic baselines.