Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver
About
In modern intelligent transportation systems (ITS), particularly in freight transportation and logistics, real-time route planning is crucial. It presents unique challenges driven by high uncertainty in service requests, where the number of service customers can vary drastically, ranging from hundreds to thousands. Existing neural methods struggle to maintain performance under such significant variations, which severely limits their practical applicability. To address this crucial shortcoming, this work proposes a novel Instance-Conditioned Adaptation Model (ICAM) designed for better large-scale generalization. In particular, we design a simple yet efficient instance-conditioned adaptation function that adjusts the policy based on the specific geometry and density of the current traffic scenario to improve model adaptability with minimal computational overhead. Furthermore, we propose a powerful yet low-complexity instance-conditioned adaptation module to generate better solutions for instances across various scales. Extensive experiments on synthetic, benchmark, and real-world instances demonstrate that ICAM can consistently achieve promising generalization performance across four widely studied large-scale route planning scenarios. Notably, our proposed method delivers high-quality solutions with remarkably fast inference speed, providing a scalable and efficient solution for real-time intelligent transportation operations. Our code is available at https://github.com/CIAM-Group/ICAM.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Traveling Salesman Problem | TSP-100 | Optimality Drop0.15 | 69 | |
| Traveling Salesman Problem | Uniform-TSP1000 | Optimality Gap1.6 | 44 | |
| Capacitated Vehicle Routing Problem | CVRP-200 | Objective Value20.4334 | 43 | |
| Traveling Salesman Problem | Uniform-TSP100 | Optimality Gap0.148 | 41 | |
| Capacitated Vehicle Routing Problem | CVRP 100 | Optimality Gap (%)2.04 | 40 | |
| Traveling Salesman Problem | TSP-500 | Solution Length16.55 | 38 | |
| Traveling Salesperson Problem | TSP-1k | Drop Rate1.58 | 38 | |
| Traveling Salesman Problem | TSP100 | Optimality Gap (%)0.15 | 37 | |
| Asymmetric Traveling Salesperson Problem | ATSP N=100 (test) | Optimality Gap4.782 | 34 | |
| Traveling Salesman Problem | Uniform Euclidean TSP n = 500 | Execution Time (s)36 | 30 |