Pith. sign in

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

arxiv 2405.01029 v2 pith:JQQKAGWN submitted 2024-05-02 cs.AI cs.LG

classification cs.AIcs.LG
keywords mvmoeroutingsolvervehicledevelopfurthergatinghierarchical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems

    cs.MA 2025-01 conditional novelty 6.0 of 10

    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.

  2. Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solvers

    cs.LG 2024-11 conditional novelty 5.0 of 10

    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...

Pith tools