Pith. sign in

REVIEW 3 cited by

Instance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.01906 v3 pith:KRCSOUDB submitted 2024-05-03 cs.AI cs.LGcs.NE

classification cs.AIcs.LGcs.NE
keywords adaptationinstance-conditionedgeneralizationicamlarge-scaletransportationacrossbetter
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Edge-aware Decoding for Neural Asymmetric Routing

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Edge-aware decoder exposes transition-level quantities at decision time, cutting the ATSP-1000 gap from 4.13% to 2.73% over RADAR on SVD/Sinkhorn backbone.

  2. GELD: A Unified Neural Model for Efficiently Solving Traveling Salesman Problems Across Different Scales

    cs.AI 2025-06 conditional novelty 6.0 of 10

    GELD solves Euclidean TSPs from 100 to 10,000 nodes with one pre-trained model and refines other solvers' solutions by 35-97 percent, reaching 744,710 nodes when combined with a heuristic.

  3. URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A single RL-trained route-construction model, fed a unified data representation plus LLM-written feasibility masks, produces competitive solutions on 107 VRP variants including 96 unseen at training time.

Pith tools