Depot-Closed Multi-Component Construction for Neural Vehicle Routing
Not on the map. Why?
Abstract (arXiv)
Most neural constructive solvers for the vehicle routing problem (VRP) use route-by-route construction, extending one route until completion before starting the next. This commits route membership early and hinders global coordination across routes. We propose multi-component construction, which maintains many route components simultaneously and merges them in an arbitrary order. This removes the depot-return cue that route-by-route construction obtains from the remaining capacity; to compensate, we introduce an interpretation in which every component is treated as an implicitly depot-closed route. Under this depot-closed interpretation, every intermediate state of standard CVRP construction is a complete feasible solution, and the exact cost reduction of a merge is the Clarke-Wright saving. The neural policy combines this CW-saving signal with the evolving component state to learn what to connect and when to connect. A policy trained only on CVRP100 outperforms the reported results of representative neural solvers on CVRP100-500 with greedy inference and, reused for ruin-and-reconstruct, performs strongly at all evaluated sizes up to CVRP1000. In a zero-shot Constraint Tightness evaluation with capacities from C=10 to 500, it outperforms the reported neural solvers at every capacity. Controlled analyses show that robustness persists without CW grounding and point to learned route-closing behavior as a plausible contributor to the tight-regime degradation of learned route-by-route solvers.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 41 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
32 of 41 references.
References · 32
- 2017Attention Is All You Needcited by 60,361
- 2015Pointer Networkscited by 895
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
- 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 221
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
- 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 142
- 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 125
20 more
- 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 119
- 2021Learning to Delegate for Large-scale Vehicle Routingcited by 109
- 2021Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformercited by 108
- 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
- 2021Efficient Active Search for Combinatorial Optimization Problemscited by 100
- 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 82
- 2023Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Optcited by 81
- 2024MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Expertscited by 70
- 2023Towards Omni-generalizable Neural Methods for Vehicle Routing Problemscited by 69
- 2023Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policycited by 62
- 2024RouteFinder: Towards Foundation Models for Vehicle Routing Problemscited by 55
- 2024Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalizationcited by 50
- 2024INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformercited by 44
- 2025Rethinking Light Decoder-based Solvers for Vehicle Routing Problemscited by 37
- 2020Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attentioncited by 29
- 2024Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectivescited by 23
- 2025Destroy and Repair Using Hyper Graphs for Routingcited by 14
- 2025Learning to Insert for Constructive Neural Vehicle Routing Solvercited by 10
- 2025Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degreescited by 8
- 2026Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Predictioncited by 1
Built on by
Not cited yet.