Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems
About
We present a novel deep reinforcement learning method to learn construction heuristics for vehicle routing problems. In specific, we propose a Multi-Decoder Attention Model (MDAM) to train multiple diverse policies, which effectively increases the chance of finding good solutions compared with existing methods that train only one policy. A customized beam search strategy is designed to fully exploit the diversity of MDAM. In addition, we propose an Embedding Glimpse layer in MDAM based on the recursive nature of construction, which can improve the quality of each policy by providing more informative embeddings. Extensive experiments on six different routing problems show that our method significantly outperforms the state-of-the-art deep learning based models.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Traveling Salesman Problem (TSP) | TSP n=100 10K instances (test) | Objective Value7.79 | 52 | |
| Traveling Salesperson Problem | TSP-100 | Solution Length7.79 | 42 | |
| Capacitated Vehicle Routing Problem | CVRP N=100 10,000 instances (test) | Objective Value15.99 | 28 | |
| Traveling Salesman Problem | Euclidean TSP N=50 | Optimal Tour Length5.7 | 26 | |
| Capacitated Vehicle Routing Problem | CVRP N=20 10,000 instances (test) | Objective Value6.14 | 26 | |
| Capacitated Vehicle Routing Problem | CVRP N=100 (test 10k inst.) | Optimality Gap2.21 | 22 | |
| Traveling Salesperson Problem | TSP N=100 (test) | Optimality Gap0.39 | 21 | |
| Capacitated Vehicle Routing Problem | CVRP n=100 (10k instances) | Optimality Gap274 | 21 | |
| Traveling Salesperson Problem | TSP N=200 (Generalization (128 instances)) | Optimality Gap2.04 | 19 | |
| Job-Shop Scheduling Problem | JSSP 100 instances 10x10 (test) | Objective Value875 | 19 |