SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2006.07054 · 2020

Learning the Travelling Salesperson Problem Requires Rethinking Generalization

arXiv · PDF · Open in the Atlas

Code that ran

3 of 7 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 4 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/2006.07054.json · badge: /api/ran/2006.07054.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
chaitjo/learning-paradigms-for-tsp canonical (classifier label)
classifier basis: census
3 ran · 3 no recorded run
chaitjo/learning-tsp canonical (classifier label)
classifier basis: classifier_2025
0 ran · 1 no recorded run
FunctionStatusWhere it lives
generate_op_data Ran
ran; our contract draft was wrong, not the code
chaitjo/learning-paradigms-for-tsp/generate_data.py
code served (permissive licence) · get_code("82eaf1d494d4fc16")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

ARGS = {
    'dataset_size': 2,
    'op_size': 20,
    'prize_type': 'const'
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list — a list output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
generate_tsp_data Ran
ran, honoured the contract we drafted
chaitjo/learning-paradigms-for-tsp/generate_data.py
code served (permissive licence) · get_code("50522f260eb670be")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list, ndim 3, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

ARGS = {
    "dataset_size": 5,
    "tsp_size": 8,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list, ndim 3, dtype family float — a list output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
generate_vrp_data Ran
ran; our contract draft was wrong, not the code
chaitjo/learning-paradigms-for-tsp/generate_data.py
code served (permissive licence) · get_code("3a929eede11222c2")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

ARGS = {
    "dataset_size": 2,
    "vrp_size": 10,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list — a list output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
get_options Not yet run
unverified (harvested, no recorded run)
chaitjo/learning-tsp/options.py
code served (permissive licence) · get_code("879b035fee7c0b04")
How it ran

no invocation recorded.

get_options Not yet run
unverified (harvested, no recorded run)
chaitjo/learning-paradigms-for-tsp/options.py
code served (permissive licence) · get_code("182bb7168c89e297")
How it ran

no invocation recorded.

solve_all_gurobi Not yet run
unverified (harvested, no recorded run)
chaitjo/learning-paradigms-for-tsp/problems/tsp/tsp_gurobi.py
code served (permissive licence) · get_code("c2eb1a9181034240")
How it ran

no invocation recorded.

solve_euclidian_tsp Not yet run
unverified (harvested, no recorded run)
chaitjo/learning-paradigms-for-tsp/problems/tsp/tsp_gurobi.py
code served (permissive licence) · get_code("c2edba20f4705527")
How it ran

no invocation recorded.

Also present in other papers' code

Of 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 3 later) and 2 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
generate_op_data 3 other papers
1 dated earlier, 2 later
1803.08475 (2018-03)
Attention, Learn to Solve Routing Problems!
2012.10638 (2020-12)
Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems
2606.30680 (2026-06)
Locker-based Truck-Drone Routing with Integrated Considerations of Pickups, Deliveries, and No-Fly Zones
generate_tsp_data 3 other papers
1 dated earlier, 2 later
1803.08475 (2018-03)
Attention, Learn to Solve Routing Problems!
2012.10638 (2020-12)
Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems
2606.30680 (2026-06)
Locker-based Truck-Drone Routing with Integrated Considerations of Pickups, Deliveries, and No-Fly Zones
generate_vrp_data 3 other papers
1 dated earlier, 2 later
1803.08475 (2018-03)
Attention, Learn to Solve Routing Problems!
2012.10638 (2020-12)
Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems
2606.30680 (2026-06)
Locker-based Truck-Drone Routing with Integrated Considerations of Pickups, Deliveries, and No-Fly Zones
solve_all_gurobi 1 other paper
1 dated earlier
1803.08475 (2018-03)
Attention, Learn to Solve Routing Problems!
solve_euclidian_tsp 1 other paper
1 dated earlier
1803.08475 (2018-03)
Attention, Learn to Solve Routing Problems!

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

End-to-end training of neural network solvers for graph combinatorial optimization problems such as the Travelling Salesperson Problem (TSP) have seen a surge of interest recently, but remain intractable and inefficient beyond graphs with few hundreds of nodes. While state-of-the-art learning-driven approaches for TSP perform closely to classical solvers when trained on trivially small sizes, they are unable to generalize the learnt policy to larger instances at practical scales. This work presents an end-to-end neural combinatorial optimization pipeline that unifies several recent papers in order to identify the inductive biases, model architectures and learning algorithms that promote generalization to instances larger than those seen in training. Our controlled experiments provide the first principled investigation into such zero-shot generalization, revealing that extrapolating beyond training data requires rethinking the neural combinatorial optimization pipeline, from network layers and learning paradigms to evaluation protocols. Additionally, we analyze recent advances in deep learning for routing problems through the lens of our pipeline and provide new directions to stimulate future research.

For agents

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

get_harvested_code_for_paper("2006.07054")
get_code_for_paper("2006.07054")
have("2006.07054")

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

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

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

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

Connect an agent — have() is free.