Metraipolis › archive › dc_dc9cc4f4c550
Depot-Closed Multi-Component Construction for Neural Vehicle Routing — arXiv:2609.35066
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35066
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T22:38:46.650Z
- SHA-256 of the archived text
4c55c7dfa65e2f0aed7396d9aaa0c8237adb3ed947c42ba361cc143d0182eecc- Stable URL of this page
https://metraipolis.com/documento/dc_dc9cc4f4c550
How to cite
Depot-Closed Multi-Component Construction for Neural Vehicle Routing — arXiv:2609.35066 — arXiv (en), https://arxiv.org/abs/2609.35066 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc9cc4f4c550 (Metraipolis archive dc_dc9cc4f4c550, sha256 4c55c7dfa65e2f0aed7396d9aaa0c8237adb3ed947c42ba361cc143d0182eecc)
BibTeX
@misc{dcdc9cc4f4c550,
title = {Depot-Closed Multi-Component Construction for Neural Vehicle Routing — arXiv:2609.35066},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35066},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc9cc4f4c550; sha256 4c55c7dfa65e2f0aed7396d9aaa0c8237adb3ed947c42ba361cc143d0182eecc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35066. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.35066 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T22:14:28.338Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).