Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-2026
Abstract
Neural Combinatorial Optimization (NCO) has emerged as a promising paradigm for solving Vehicle Routing Problems (VRPs), offering a compelling alternative to traditional heuristics. However, extending NCO to VRPs with complex constraints remains a significant challenge, as existing methods largely rely on hand-crafted feasibility masks, thereby bypassing the core difficulty of intrinsic constraint reasoning. In this paper, we identify a critical phenomenon in constrained VRPs termed the Global Cascading Effect: myopic local decisions can irreversibly lead to the collapse of the future feasible space, resulting in severe constraint violations. We systematically analyze why the prevailing Heavy Encoder Light Decoder (HELD) paradigm, typically trained via reinforcement learning, fails to capture this effect, attributing the failure to three critical couplings: static architectural embeddings, ambiguous trajectory-level feedback, and entangled feature representations. To address these issues, we propose DeCo (Decoupled Constrained Optimization), a streamlined end-to-end framework designed to systematically dismantle these couplings. DeCo leverages a heavy decoder architecture to achieve real-time feasibility perception through step-wise re-embedding, incorporates dense supervised learning for precise credit assignment, and introduces a Decoupled Attention Block with a dual-stream structure to eliminate feature interference. Extensive experiments on complex constrained benchmarks, such as Traveling Salesman Problem with Time Windows (TSPTW) and Draft Limits (TSPDL), demonstrate that DeCo achieves state-of-the-art (SOTA) performance under a pure end-to-end paradigm without any auxiliary masking mechanisms.
Keywords
Learning to Optimize, Vehicle Routing Problems, Constraint Optimization, Representation Learning
Discipline
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Research Areas
Intelligent Systems and Optimization
Areas of Excellence
Sustainability
Publication
KDD '26: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2, Jeju Island, South Korea, August 9-13
First Page
245
Last Page
256
Identifier
10.1145/3770855.3817954
Publisher
ACM
City or Country
New York
Citation
CAO, Rui; CAO, Zhiguang; HUANG, Yihan; WANG, Jiaqi; JIANG, Yuan; XIAO, Yubin; and ZHOU, You.
Learning to handle constrained routing problems from a decoupling perspective. (2026). KDD '26: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2, Jeju Island, South Korea, August 9-13. 245-256.
Available at: https://ink.library.smu.edu.sg/sis_research/11396
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1145/3770855.3817954
Included in
Artificial Intelligence and Robotics Commons, Operations Research, Systems Engineering and Industrial Engineering Commons