{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/rethinking-neural-combinatorial-optimization","title":"Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degrees","arxiv_id":"2505.24627","date":"2025-05-30","proceeding":null,"authors":["Fu Luo","Yaoxin Wu","Zhi Zheng","Zhenkun Wang"],"abstract":"Recent neural combinatorial optimization (NCO) methods have shown promising problem-solving ability without requiring domain-specific expertise. Most existing NCO methods use training and testing data with a fixed constraint value and lack research on the effect of constraint tightness on the performance of NCO methods. This paper takes the capacity-constrained vehicle routing problem (CVRP) as an example to empirically analyze the NCO performance under different tightness degrees of the capacity constraint. Our analysis reveals that existing NCO methods overfit the capacity constraint, and they can only perform satisfactorily on a small range of the constraint values but poorly on other values. To tackle this drawback of existing NCO methods, we develop an efficient training scheme that explicitly considers varying degrees of constraint tightness and proposes a multi-expert module to learn a generally adaptable solving strategy. Experimental results show that the proposed method can effectively overcome the overfitting issue, demonstrating superior performances on the CVRP and CVRP with time windows (CVRPTW) with various constraint tightness degrees.","url_abs":"https://arxiv.org/abs/2505.24627v1","url_pdf":"https://arxiv.org/pdf/2505.24627v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2505.24627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24627"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness","reach":null}],"summary":{"ran":1,"unverified":4},"by_repo_kind":{"found_in_text":{"samples":5,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"12eed0248123d6a0","entry":"Add_And_Normalization_Module","repo":"CIAM-Group/Rethinking_Constraint_Tightness","repo_kind":"found_in_text","path":"CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","file_url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness/blob/HEAD/CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"12eed0248123d6a0"}},{"code_sha256_prefix":"62e4266474eff621","entry":"EncoderLayer","repo":"CIAM-Group/Rethinking_Constraint_Tightness","repo_kind":"found_in_text","path":"CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","file_url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness/blob/HEAD/CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"62e4266474eff621"}},{"code_sha256_prefix":"d19d26c7d1707d43","entry":"SINGLEModel","repo":"CIAM-Group/Rethinking_Constraint_Tightness","repo_kind":"found_in_text","path":"CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","file_url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness/blob/HEAD/CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d19d26c7d1707d43"}},{"code_sha256_prefix":"18b56e2f129cf77f","entry":"SINGLE_Decoder","repo":"CIAM-Group/Rethinking_Constraint_Tightness","repo_kind":"found_in_text","path":"CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","file_url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness/blob/HEAD/CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"18b56e2f129cf77f"}},{"code_sha256_prefix":"ba91569b61e13544","entry":"SINGLE_Encoder","repo":"CIAM-Group/Rethinking_Constraint_Tightness","repo_kind":"found_in_text","path":"CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","file_url":"https://github.com/CIAM-Group/Rethinking_Constraint_Tightness/blob/HEAD/CVRPTW/Routing-MVMoE-main-TW/models/SINGLEModel.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ba91569b61e13544"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}