Adding simulated annealing to random reconstruction and beam search to POMO in neural CVRP solvers reduces optimality gaps on standard benchmarks.
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.Mathematical Programming, 115:351–385, 2008
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
-
NCO4CVRP: Neural Combinatorial Optimization for the Capacitated Vehicle Routing Problem
Adding simulated annealing to random reconstruction and beam search to POMO in neural CVRP solvers reduces optimality gaps on standard benchmarks.