REVIEW 2 cited by
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Learning to solve vehicle routing problems (VRPs) has garnered much attention. However, most neural solvers are only structured and trained independently on a specific problem, making them less generic and practical. In this paper, we aim to develop a unified neural solver that can cope with a range of VRP variants simultaneously. Specifically, we propose a multi-task vehicle routing solver with mixture-of-experts (MVMoE), which greatly enhances the model capacity without a proportional increase in computation. We further develop a hierarchical gating mechanism for the MVMoE, delivering a good trade-off between empirical performance and computational complexity. Experimentally, our method significantly promotes zero-shot generalization performance on 10 unseen VRP variants, and showcases decent results on the few-shot setting and real-world benchmark instances. We further conduct extensive studies on the effect of MoE configurations in solving VRPs, and observe the superiority of hierarchical gating when facing out-of-distribution data. The source code is available at: https://github.com/RoyalSkye/Routing-MVMoE.
Forward citations
Cited by 2 Pith papers
-
CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems
CAMP is a new attention-based multi-agent RL solver for vehicle routing with per-client profiles, outperforming prior neural baselines on both preference and zone-constrained variants.
-
Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solvers
After per-heatmap tuning of MCTS hyperparameters, a simple k-nearest-neighbor heatmap (GT-Prior) matches or beats learned heatmaps on uniform, shifted-distribution, and TSPLIB benchmarks, while search settings alone s...
Discussion (0). Continue with ORCID to comment.