{"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/neural-combinatorial-optimization-with-heavy","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","arxiv_id":"2310.07985","date":"2023-10-12","proceeding":"NeurIPS 2023 11","authors":["Fu Luo","Xi Lin","Fei Liu","Qingfu Zhang","Zhenkun Wang"],"abstract":"Neural combinatorial optimization (NCO) is a promising learning-based approach for solving challenging combinatorial optimization problems without specialized algorithm design by experts. However, most constructive NCO methods cannot solve problems with large-scale instance sizes, which significantly diminishes their usefulness for real-world applications. In this work, we propose a novel Light Encoder and Heavy Decoder (LEHD) model with a strong generalization ability to address this critical issue. The LEHD model can learn to dynamically capture the relationships between all available nodes of varying sizes, which is beneficial for model generalization to problems of various scales. Moreover, we develop a data-efficient training scheme and a flexible solution construction mechanism for the proposed LEHD model. By training on small-scale problem instances, the LEHD model can generate nearly optimal solutions for the Travelling Salesman Problem (TSP) and the Capacitated Vehicle Routing Problem (CVRP) with up to 1000 nodes, and also generalizes well to solve real-world TSPLib and CVRPLib problems. These results confirm our proposed LEHD model can significantly improve the state-of-the-art performance for constructive NCO. The code is available at https://github.com/CIAM-Group/NCO_code/tree/main/single_objective/LEHD.","url_abs":"https://arxiv.org/abs/2310.07985v2","url_pdf":"https://arxiv.org/pdf/2310.07985v2.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":[{"paper_slug":"neural-combinatorial-optimization-with-heavy","repo_url":"https://github.com/ciam-group/nco_code","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"decoder","task_name":"Decoder"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.07985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07985"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ciam-group/nco_code","reach":null}],"summary":{"ran":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"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":"c559544d2b05dfa9","entry":"DecoderLayer","repo":"ciam-group/nco_code","repo_kind":"official","path":"single_objective/LEHD/CVRP/VRPModel.py","file_url":"https://github.com/ciam-group/nco_code/blob/HEAD/single_objective/LEHD/CVRP/VRPModel.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":"c559544d2b05dfa9"}},{"code_sha256_prefix":"d8afc21ac6216353","entry":"CVRP_Decoder","repo":"ciam-group/nco_code","repo_kind":"official","path":"single_objective/LEHD/CVRP/VRPModel.py","file_url":"https://github.com/ciam-group/nco_code/blob/HEAD/single_objective/LEHD/CVRP/VRPModel.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":"d8afc21ac6216353"}},{"code_sha256_prefix":"9c8f6c89b8e8caf7","entry":"VRPModel","repo":"ciam-group/nco_code","repo_kind":"official","path":"single_objective/LEHD/CVRP/VRPModel.py","file_url":"https://github.com/ciam-group/nco_code/blob/HEAD/single_objective/LEHD/CVRP/VRPModel.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":"9c8f6c89b8e8caf7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}