ARC: Leveraging Compositional Representations for Cross-Problem Learning on VRPs
Not on the map. Why?
Abstract (arXiv)
Vehicle Routing Problems (VRPs) with diverse real-world attributes have driven recent interest in cross-problem learning approaches that efficiently generalize across problem variants. We propose ARC (Attribute Representation via Compositional Learning), a cross-problem learning framework that learns disentangled attribute representations by decomposing them into two complementary components: an Intrinsic Attribute Embedding (IAE) for invariant attribute semantics and a Contextual Interaction Embedding (CIE) for attribute-combination effects. This disentanglement is achieved by enforcing analogical consistency in the embedding space to ensure the semantic transformation of adding an attribute (e.g., a length constraint) remains invariant across different problem contexts. This enables our model to reuse invariant semantics across trained variants and construct representations for unseen combinations. ARC achieves state-of-the-art performance across in-distribution, zero-shot generalization, few-shot adaptation, and real-world benchmarks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 21 Dec 2025.
Builds on
22 of 30 references.
References · 22
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2016CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoningcited by 1,445
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
- 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
- 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
- 2022Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimizationcited by 118
- 2017Zero-Shot Task Generalization with Multi-Task Deep Reinforcement Learningcited by 97
- 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 80
- 2024MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Expertscited by 69
10 more
- 2024RouteFinder: Towards Foundation Models for Vehicle Routing Problemscited by 54
- 2023PyVRP: a high-performance VRP solver packagecited by 50
- 2024Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalizationcited by 49
- 2020A Boolean Task Algebra for Reinforcement Learningcited by 46
- 2024GOAL: A Generalist Combinatorial Optimization Agent Learnercited by 39
- 2025Rethinking Light Decoder-based Solvers for Vehicle Routing Problemscited by 36
- 2024CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attentioncited by 23
- 2023Composition-contrastive Learning for Sentence Embeddingscited by 14
- 2025MTL-KD: Multi-Task Learning Via Knowledge Distillation for Generalizable Neural Vehicle Routing Solvercited by 13
- 2019Plan Arithmetic: Compositional Plan Vectors for Multi-Task Controlcited by 10
Built on by
Not cited yet.