mlsanityData to 14 Oct 2026

Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problems

arXiv 2401.06979 ↗First posted 13 Jan 2024cs.AI cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Neural solvers based on attention mechanism have demonstrated remarkable effectiveness in solving vehicle routing problems. However, in the generalization process from small scale to large scale, we find a phenomenon of the dispersion of attention scores in existing neural solvers, which leads to poor performance. To address this issue, this paper proposes a distance-aware attention reshaping method, assisting neural solvers in solving large-scale vehicle routing problems. Specifically, without the need for additional training, we utilize the Euclidean distance information between current nodes to adjust attention scores. This enables a neural solver trained on small-scale instances to make rational choices when solving a large-scale problem. Experimental results show that the proposed method significantly outperforms existing state-of-the-art neural solvers on the large-scale CVRPLib dataset.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 26 of its 41 references that are in the map. First posted on arXiv 13 Jan 2024.

Builds on

26 of 41 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Pointer Networkscited by 895
  3. 2018Attention, Learn to Solve Routing Problems!cited by 656
  4. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  5. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  6. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
  7. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  8. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
  9. 2019Learning Improvement Heuristics for Solving Routing Problemscited by 164
  10. 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 162
  11. 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 142
  12. 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 125
14 more
  1. 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 119
  2. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 109
  3. 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
  4. 2021Learning Collaborative Policies to Solve NP-hard Routing Problemscited by 86
  5. 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 85
  6. 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
  7. 2019Exploratory Combinatorial Optimization with Reinforcement Learningcited by 82
  8. 2023Towards Omni-generalizable Neural Methods for Vehicle Routing Problemscited by 69
  9. 2022Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillationcited by 62
  10. 2023Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policycited by 62
  11. 2021The Transformer Network for the Traveling Salesman Problemcited by 59
  12. 2023Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problemcited by 50
  13. 2023H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problemcited by 43
  14. 2022How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problemcited by 27

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 6; 2025: 7; 2026: 2.

15 papers.

Sort:

By area:

  1. 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
  2. 2025Rethinking Light Decoder-based Solvers for Vehicle Routing Problemscited by 37
  3. 2024Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectivescited by 23
  4. 2024DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problemscited by 18
  5. 2025Learning to Reduce Search Space for Generalizable Neural Routing Solvercited by 14
  6. 2025Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learningcited by 12
  7. 2025Learning to Insert for Constructive Neural Vehicle Routing Solvercited by 10
  8. 2024Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solvercited by 9
  9. 2024PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimizationcited by 7
  10. 2025Efficient Neural Combinatorial Optimization Solver for the Min-max Heterogeneous Capacitated Vehicle Routing Problemcited by 3
  11. 2025Probing Neural Combinatorial Optimization Modelscited by 3
  12. 2025USPR: Learning a Unified Solver for Profiled Routingcited by 1
3 more
  1. 2024Learn to Solve Vehicle Routing Problems ASAP: A Neural Optimization Approach for Time-Constrained Vehicle Routing Problems with Finite Vehicle Fleetcited by 0
  2. 2026Keep Rehearsing and Refining: Lifelong Learning Vehicle Routing under Continually Drifting Taskscited by 0
  3. 2026Edge-aware Decoding for Neural Asymmetric Routingcited by 0