MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Multi-Depot Vehicle Routing Problem | Cordeau MDVRP | Objective Value1.76e+3 | 125 | |
| Capacitated Vehicle Routing Problem | CVRPLib Set X | Average Optimality Gap6.88 | 114 | |
| Capacitated Vehicle Routing Problem | CVRP N=100 | Objective Value15.76 | 87 | |
| Vehicle Routing Problem Optimization | VRPMB (100-node instances) | Objective Value14.99 | 45 | |
| Capacitated Vehicle Routing Problem | CVRP 100 | Optimality Gap (%)1.65 | 36 | |
| Vehicle Routing Problem with Time Windows | Solomon 1987 (Generalization Set) | Obj Value1.73e+3 | 33 | |
| Multi-Depot Vehicle Routing Problem | MDVRP n=100 | Objective Value8.39 | 30 | |
| Vehicle Routing Problem | OCVRP 48 standard 100-node benchmark instances | Objective Value10.85 | 27 | |
| Vehicle Routing Problem | VRP Variant Specific (n=50, 100) 1K 1 (test) | Objective Value5.998 | 25 | |
| Multi-Depot Vehicle Routing Problem | MDVRP n=50 | Objective Value5.503 | 24 |