mlsanityData to 7 Oct 2026

MTL-KD: Multi-Task Learning Via Knowledge Distillation for Generalizable Neural Vehicle Routing Solver

arXiv 2506.02935 ↗First posted 3 Jun 2025cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Multi-Task Learning (MTL) in Neural Combinatorial Optimization (NCO) is a promising approach to train a unified model capable of solving multiple Vehicle Routing Problem (VRP) variants. However, existing Reinforcement Learning (RL)-based multi-task methods can only train light decoder models on small-scale problems, exhibiting limited generalization ability when solving large-scale problems. To overcome this limitation, this work introduces a novel multi-task learning method driven by knowledge distillation (MTL-KD), which enables the efficient training of heavy decoder models with strong generalization ability. The proposed MTL-KD method transfers policy knowledge from multiple distinct RL-based single-task models to a single heavy decoder model, facilitating label-free training and effectively improving the model's generalization ability across diverse tasks. In addition, we introduce a flexible inference strategy termed Random Reordering Re-Construction (R3C), which is specifically adapted for diverse VRP tasks and further boosts the performance of the multi-task model. Experimental results on 6 seen and 10 unseen VRP variants with up to 1000 nodes indicate that our proposed method consistently achieves superior performance on both uniform and real-world benchmarks, demonstrating robust generalization abilities.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 34 of its 54 references that are in the map. First posted on arXiv 3 Jun 2025.

Builds on

34 of 54 references.

References · 34

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2015Pointer Networkscited by 882
  3. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  4. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
  5. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  6. 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
  7. 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 122
  8. 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 118
  9. 2021NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problemcited by 102
  10. 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
  11. 2025Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Designcited by 100
  12. 2021Matrix Encoding Networks for Neural Combinatorial Optimizationcited by 89
22 more
  1. 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 82
  2. 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 80
  3. 2024MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Expertscited by 69
  4. 2023Towards Omni-generalizable Neural Methods for Vehicle Routing Problemscited by 68
  5. 2022Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillationcited by 61
  6. 2023Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policycited by 61
  7. 2024RouteFinder: Towards Foundation Models for Vehicle Routing Problemscited by 54
  8. 2023PyVRP: a high-performance VRP solver packagecited by 50
  9. 2023Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problemcited by 49
  10. 2024Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalizationcited by 49
  11. 2024UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problemscited by 45
  12. 2024INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformercited by 43
  13. 2025Rethinking Light Decoder-based Solvers for Vehicle Routing Problemscited by 36
  14. 2024Cross-Problem Learning for Solving Vehicle Routing Problemscited by 24
  15. 2024CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attentioncited by 23
  16. 2023Distilling Autoregressive Models to Obtain High-Performance Non-Autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speedcited by 19
  17. 2024DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problemscited by 18
  18. 2025Neural Deconstruction Search for Vehicle Routing Problemscited by 15
  19. 2025Learning to Reduce Search Space for Generalizable Neural Routing Solvercited by 14
  20. 2025ARS: Automatic Routing Solver with Large Language Modelscited by 13
  21. 2023Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handlingcited by 10
  22. 2025Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degreescited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 10.

13 papers.

Sort: