Training neural routing solvers on subsamples of a fixed base node distribution narrows or reverses the performance gap to classical OR meta-heuristics on several TSP and CVRP benchmarks.
Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribution generalization concerns, we bring the knowledge distillation to this field and propose an Adaptive Multi-Distribution Knowledge Distillation (AMDKD) scheme for learning more generalizable deep models. Particularly, our AMDKD leverages various knowledge from multiple teachers trained on exemplar distributions to yield a light-weight yet generalist student model. Meanwhile, we equip AMDKD with an adaptive strategy that allows the student to concentrate on difficult distributions, so as to absorb hard-to-master knowledge more effectively. Extensive experimental results show that, compared with the baseline neural methods, our AMDKD is able to achieve competitive results on both unseen in-distribution and out-of-distribution instances, which are either randomly synthesized or adopted from benchmark datasets (i.e., TSPLIB and CVRPLIB). Notably, our AMDKD is generic, and consumes less computational resources for inference.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
On Distributional Dependent Performance of Classical and Neural Routing Solvers
Training neural routing solvers on subsamples of a fixed base node distribution narrows or reverses the performance gap to classical OR meta-heuristics on several TSP and CVRP benchmarks.