SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2110.13987 · NeurIPS · 2021

Learning Collaborative Policies to Solve NP-hard Routing Problems

Minsu Kim, Jinkyoo Park, Joungho Kim

arXiv · PDF · Open in the Atlas

Code that ran

6 of 11 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (4 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 4 have no contract verdict; 2 failures of our instrument; 5 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2110.13987.json · badge: /api/ran/2110.13987.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
alstn12088/lcp canonical (classifier label)
classifier basis: classifier_2025
6 ran · 5 no recorded run
FunctionStatusWhere it lives
CachedLookup Ran
ran on a synthesized input · constructed an object; no result was computed
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("88d0041a61c7c24e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

LCP_TSP Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("ada666a76adb71c1")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

MultiHeadAttention Ran
ran on a synthesized input · constructed an object; no result was computed
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("c5d3fd20d5155301")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

MultiHeadAttentionLayer Ran
ran on a synthesized input · constructed an object; no result was computed
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("dd680450b0176037")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

PositionalEncoding Ran
ran on a synthesized input · constructed an object; no result was computed
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("2315c99926d06f41")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

decomposition Ran
ran; our contract draft was wrong, not the code
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("a23d253f0a097ed3")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

AttentionModel Not yet run
unverified (harvested, no recorded run)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("654e85e1dfb7a324")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

GraphAttentionEncoder Not yet run
unverified (harvested, no recorded run)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("5b916624ecb45a96")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

compute_in_batches Not yet run
unverified (harvested, no recorded run)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("c15e4327c52243c6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

revision Not yet run
unverified (harvested, no recorded run)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("ccfdec9c8e6fb04f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

sample_many Not yet run
unverified (harvested, no recorded run)
alstn12088/lcp/nets/attention_model.py
pointer only (licence: NONE) · get_code("5f3e3de087964e54")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, alstn12088/lcp when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 11 samples lifted from this paper's linked repositories, 11 carry a function identity and 0 do not. Of the 11 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 8 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
CachedLookup
brick of this paper's assembly: helper
2 other papers
2 later · 2 only as an assembly brick
2204.03236 (2022-04)
Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum
2205.13225 (2022-05)
DevFormer: A Symmetric Transformer for Context-Aware Device Placement
MultiHeadAttentionLayer
brick of this paper's assembly: helper
2 other papers
2 later · 1 only as an assembly brick
2204.03236 (2022-04)
Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum
2205.13225 (2022-05)
DevFormer: A Symmetric Transformer for Context-Aware Device Placement
compute_in_batches
brick of this paper's assembly: helper
2 other papers
2 later · 2 only as an assembly brick
2204.03236 (2022-04)
Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum
2205.13225 (2022-05)
DevFormer: A Symmetric Transformer for Context-Aware Device Placement

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Recently, deep reinforcement learning (DRL) frameworks have shown potential for solving NP-hard routing problems such as the traveling salesman problem (TSP) without problem-specific expert knowledge. Although DRL can be used to solve complex problems, DRL frameworks still struggle to compete with state-of-the-art heuristics showing a substantial performance gap. This paper proposes a novel hierarchical problem-solving strategy, termed learning collaborative policies (LCP), which can effectively find the near-optimum solution using two iterative DRL policies: the seeder and reviser. The seeder generates as diversified candidate solutions as possible (seeds) while being dedicated to exploring over the full combinatorial action space (i.e., sequence of assignment action). To this end, we train the seeder's policy using a simple yet effective entropy regularization reward to encourage the seeder to find diverse solutions. On the other hand, the reviser modifies each candidate solution generated by the seeder; it partitions the full trajectory into sub-tours and simultaneously revises each sub-tour to minimize its traveling distance. Thus, the reviser is trained to improve the candidate solution's quality, focusing on the reduced solution space (which is beneficial for exploitation). Extensive experiments demonstrate that the proposed two-policies collaboration scheme improves over single-policy DRL framework on various NP-hard routing problems, including TSP, prize collecting TSP (PCTSP), and capacitated vehicle routing problem (CVRP).

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2110.13987")
get_code_for_paper("2110.13987")
have("2110.13987")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2110.13987.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2110.13987.svg)](https://syntology.ai/paper/2110.13987)

Connect an agent — have() is free.