A two-stage neural solver for multi-depot vehicle routing, combining a tour-assignment transformer with a per-tour TSP router, reports near-optimal results on instances up to 1,000 customers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
DeepMDV: Global Spatial Matching for Multi-depot Vehicle Routing Problems
A two-stage neural solver for multi-depot vehicle routing, combining a tour-assignment transformer with a per-tour TSP router, reports near-optimal results on instances up to 1,000 customers.