Chain-of-Context Learning: Dynamic Constraint Understanding for Multi-Task VRPs
Shuangchun Gui, Suyu Liu, Xuehe Wang, Zhiguang Cao
Abstract
Multi-task Vehicle Routing Problems (VRPs) aim to minimize routing costs while satisfying diverse constraints. Existing solvers typically adopt a unified reinforcement learning (RL) framework to learn generalizable patterns across tasks. However, they often overlook the constraint and node dynamics during the decision process, making the model fail to accurately react to the current context. To address this limitation, we propose Chain-of-Context Learning (CCL), a novel framework that progressively captures the evolving context to guide fine-grained node adaptation. Specifically, CCL constructs step-wise contextual information via a Relevance-Guided Context Reformulation (RGCR) module, which adaptively prioritizes salient constraints. This context then guides node updates through a Trajectory-Shared Node Re-embedding (TSNR) module, which aggregates shared node features from all trajectories' contexts and uses them to update inputs for the next step. By modeling evolving preferences of the RL agent, CCL captures step-by-step dependencies in sequential decision-making. We evaluate CCL on 48 diverse VRP variants, including 16 in-distribution and 32 out-of-distribution (with unseen constraints) tasks. Experimental results show that CCL performs favorably against the state-of-the-art baselines, achieving the best performance on all in-distribution tasks and the majority of out-of-distribution tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6d9e7d44-c2c8-4ef7-92c4-c0436ff0c3c4Cited by top-tier papers1
Ask how each one uses itBuilds on28
- POMO: Policy Optimization with Multiple Optima for Reinforcement LearningYeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon et al.NeurIPS 2020 · 731 citations
- Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale GeneralizationFu Luo, Xi Lin, Fei Liu, Qingfu Zhang et al.NeurIPS 2023 · 248 citations
- NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman ProblemLiang Xin, Wen Song, Zhiguang Cao, Jie ZhangNeurIPS 2021 · 202 citations
- Sym-NCO: Leveraging Symmetricity for Neural Combinatorial OptimizationMinsu Kim, Junyoung Park, Jinkyoo ParkNeurIPS 2022 · 200 citations
- Learning to delegate for large-scale vehicle routingSirui Li, Zhongxia Yan, Cathy WuNeurIPS 2021 · 181 citations
Related papers
- USPR: Learning a Unified Solver for Profiled RoutingChuanbo Hua, Federico Berto, Zhikai Zhao, Jiwoo Son et al.AAAI 2026 · 2 citations
- Combination-of-Experts with Knowledge Sharing for Cross-Task Vehicle Routing ProblemsZikang Yu, Jinbiao Chen, Jiahai WangICLR 2026
- MTL-KD: Multi-Task Learning Via Knowledge Distillation for Generalizable Neural Vehicle Routing SolverYuepeng Zheng, Fu Luo, Zhenkun Wang, Yaoxin Wu et al.NeurIPS 2025 · 13 citations
- Lifelong Learning with Behavior Consolidation for Vehicle RoutingJiyuan Pei, Yi Mei, Jialin Liu, Mengjie Zhang et al.ICLR 2026 · 1 citation
- MAPDP: Cooperative Multi-Agent Reinforcement Learning to Solve Pickup and Delivery ProblemsZefang Zong, Meng Zheng, Yong Li, Depeng JinAAAI 2022 · 66 citations
