Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 40 of its 94 references that are in the map. First posted on arXiv 3 May 2024.
Builds on
40 of 94 references.
References · 40
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Pointer Networkscited by 882
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
- 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 265
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
- 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 161
28 more
- 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
- 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
- 2020Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhoodcited by 122
- 2021An Attention Free Transformercited by 111
- 2021Learning to Delegate for Large-scale Vehicle Routingcited by 108
- 2021Efficient Active Search for Combinatorial Optimization Problemscited by 99
- 2021Matrix Encoding Networks for Neural Combinatorial Optimizationcited by 89
- 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
- 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 82
- 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 80
- 2024MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Expertscited by 69
- 2023Towards Omni-generalizable Neural Methods for Vehicle Routing Problemscited by 68
- 2023Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policycited by 61
- 2023Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problemcited by 49
- 2024Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalizationcited by 49
- 2023H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problemcited by 43
- 2021Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learningcited by 35
- 2022On the Generalization of Neural Combinatorial Optimization Heuristicscited by 24
- 2023Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimizationcited by 23
- 2021An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problemcited by 22
- 2020Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimizationcited by 19
- 2023Distilling Autoregressive Models to Obtain High-Performance Non-Autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speedcited by 19
- 2024Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problemscited by 15
- 2022Learning to Solve Multiple-TSP with Time Window and Rejections via Deep Reinforcement Learningcited by 8
- 2023Neural Airport Ground Handlingcited by 7
- 2021DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problemcited by 5
- 2017Memetic search for identifying critical nodes in sparse graphscited by 3
- 2023Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problemscited by 2
Built on by
Citing papers per year: 2025: 3; 2026: 6.
9 papers.
- 2025Learning to Reduce Search Space for Generalizable Neural Routing Solvercited by 14
- 2025URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalizationcited by 7
- 2026Efficient Decoder Scaling Strategy for Neural Routing Solverscited by 1
- 2026Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solvercited by 1
- 2026SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solvercited by 1
- 2025Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigmcited by 0
- 2026SEAFormer: A Spatial Proximity and Edge-Aware Transformer for Real-World Vehicle Routing Problemscited by 0
- 2026Two-Stage Learned Decomposition for Scalable Routing on Multigraphscited by 0
- 2026MiLoop: Selective Memory Propagation for Neural Combinatorial Optimizationcited by 0
- 2026MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization1 Oct 2026
- 2026SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver23 May 2026
- 2026Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solver11 May 2026
- 2026Two-Stage Learned Decomposition for Scalable Routing on Multigraphs6 May 2026
- 2026Efficient Decoder Scaling Strategy for Neural Routing Solvers28 Feb 2026
- 2026SEAFormer: A Spatial Proximity and Edge-Aware Transformer for Real-World Vehicle Routing Problems27 Jan 2026
- 2025Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm29 Sep 2025
- 2025URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization27 Sep 2025
- 2025Learning to Reduce Search Space for Generalizable Neural Routing Solver5 Mar 2025