{"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/destroy-and-repair-using-hyper-graphs-for","title":"Destroy and Repair Using Hyper Graphs for Routing","arxiv_id":"2502.16170","date":"2025-02-22","proceeding":null,"authors":["Ke Li","Fei Liu","Zhengkun Wang","Qingfu Zhang"],"abstract":"Recent advancements in Neural Combinatorial Optimization (NCO) have shown promise in solving routing problems like the Traveling Salesman Problem (TSP) and Capacitated Vehicle Routing Problem (CVRP) without handcrafted designs. Research in this domain has explored two primary categories of methods: iterative and non-iterative. While non-iterative methods struggle to generate near-optimal solutions directly, iterative methods simplify the task by learning local search steps. However, existing iterative methods are often limited by restricted neighborhood searches, leading to suboptimal results. To address this limitation, we propose a novel approach that extends the search to larger neighborhoods by learning a destroy-and-repair strategy. Specifically, we introduce a Destroy-and-Repair framework based on Hyper-Graphs (DRHG). This framework reduces consecutive intact edges to hyper-edges, allowing the model to pay more attention to the destroyed part and decrease the complexity of encoding all nodes. Experiments demonstrate that DRHG achieves stateof-the-art performance on TSP with up to 10,000 nodes and shows strong generalization to real-world TSPLib and CVRPLib problems.","url_abs":"https://arxiv.org/abs/2502.16170v1","url_pdf":"https://arxiv.org/pdf/2502.16170v1.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":"destroy-and-repair-using-hyper-graphs-for","repo_url":"https://github.com/ciam-group/drhg","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":"traveling-salesman-problem","task_name":"Traveling Salesman Problem"}],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2502.16170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16170"}},"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/drhg","reach":null}],"summary":{"ran":2,"unverified":3},"by_repo_kind":{"official":{"samples":5,"ran":2,"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":5,"samples":[{"code_sha256_prefix":"487387db6abbe2c3","entry":"TSP_Encoder","repo":"ciam-group/drhg","repo_kind":"official","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"487387db6abbe2c3"}},{"code_sha256_prefix":"ad3bd27f42d432bc","entry":"multi_head_attention","repo":"ciam-group/drhg","repo_kind":"official","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ad3bd27f42d432bc"}},{"code_sha256_prefix":"99364ba259b31efe","entry":"DecoderLayer","repo":"ciam-group/drhg","repo_kind":"official","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"99364ba259b31efe"}},{"code_sha256_prefix":"c140be6820df74b6","entry":"TSPModel","repo":"ciam-group/drhg","repo_kind":"official","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c140be6820df74b6"}},{"code_sha256_prefix":"e151b0e19b0e6db4","entry":"TSP_Decoder","repo":"ciam-group/drhg","repo_kind":"official","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e151b0e19b0e6db4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}