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 | |
|---|---|---|---|---|
| Capacitated Vehicle Routing Problem | CVRPLib Set X | Average Optimality Gap6.88 | 111 | |
| Capacitated Vehicle Routing Problem | CVRP N=100 | Objective Value15.76 | 50 | |
| Vehicle Routing Problem with Time Windows | Solomon 1987 (Generalization Set) | Obj Value1.73e+3 | 33 | |
| Capacitated Vehicle Routing Problem with Backhauls and Time Windows | CVRPBLTW n=50 v1 | Objective Value15.945 | 18 | |
| Capacitated Vehicle Routing Problem with Backhauls and Time Windows | CVRPBLTW n=100 v1 | Objective Value27.142 | 18 | |
| Vehicle Routing Problem | OVRP n=100 | Time (m)9 | 12 | |
| Vehicle Routing Problem | CVRP N=50 | Computation Time (m)2 | 12 | |
| Vehicle Routing Problem | VRPB n=50 | Computation Time (min)2 | 12 | |
| Vehicle Routing Problem | CVRP N=100 | Computation Time (min)9 | 6 | |
| Vehicle Routing Problem | VRPTW n=100 | Computation Time (min)10 | 6 |