Browse State-of-the-Art › Traveling Salesman Problem
Traveling Salesman Problem
91 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 254 · with a code link: 91 · where Syntology ran a sample: 27 (24 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (27 of 254 tagged: 24 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument)
Page 1 of 3: papers 1 to 100 of 254, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
29 Nov 2016 10 repositories listed Syntology 14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified (of 20 harvested samples) · 7 pointer-only (licence)Despite the computational expense, without much engineering and heuristic designing, Neural Combinatorial Optimization achieves close to optimal results on 2D Euclidean graphs with up to 100 nodes.
-
4 Dec 2019 7 repositories listedAchieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence.
-
4 Jan 2024 6 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)EoH represents the ideas of heuristics in natural language, termed thoughts.
-
7 Feb 2024 3 repositories listed Syntology official (archive's flag): 9 ran · 10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified (of 13 harvested samples)We also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
-
29 Jun 2023 3 repositories listed Syntology official (archive's flag): 9 ran · 12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified (of 16 harvested samples) · 3 pointer-only (licence)To fill this gap, we introduce RL4CO, a unified and extensive benchmark with in-depth library coverage of 23 state-of-the-art methods and more than 20 CO problems.
-
6 Sep 2024 2 repositories listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 7 pointer-only (licence)In this paper, we design a family of non-autoregressive neural networks to solve CO problems under positive linear constraints with the following merits.
-
5 Jun 2023 2 repositories listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)Notably, our method achieves significant reductions of runtime, approximately 335 times, and cost values of about 53% compared to a competitive heuristic (LKH3) in the case of 100 vehicles with 1, 000 cities of mTSP.
-
19 Apr 2023 2 repositories listed Syntology official: no sample here; runs from other or unrecorded repositories · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader domains, such as manufacturing and…
-
30 May 2022 2 repositories listedEmbedding discrete solvers as differentiable layers has given modern deep learning architectures combinatorial expressivity and discrete reasoning capabilities.
-
6 Oct 2021 2 repositories listed Syntology official (archive's flag): 7 ran · 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified (of 16 harvested samples)Moreover, the positional features are embedded through a novel cyclic positional encoding (CPE) method to allow Transformer to effectively capture the circularity and symmetry of VRP solutions (i. e., cyclic sequences).
-
6 May 2020 2 repositories listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)In this work, we show that (1) the simplest hill-climbing algorithm is a powerful baseline for NAS, and (2), when the noise in popular NAS benchmark datasets is reduced to a minimum, hill-climbing to outperforms many…
-
12 Nov 2019 2 repositories listed Syntology community repositories only · 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 9 harvested samples)Furthermore, to approximate solutions to constrained combinatorial optimization problems such as the TSP with time windows, we train hierarchical GPNs (HGPNs) using RL, which learns a hierarchical policy to find an…
-
19 Apr 2019 2 repositories listedThese are the Smuggler and Donkeys.
-
21 May 2025 1 repository listedDialogue agents that support human users in solving complex tasks have received much attention recently.
-
5 Mar 2025 1 repository listedRecent works focus only on well-known combinatorial optimization problems like the traveling salesman problem and online bin packing problem when designing constructive heuristics.
-
22 Feb 2025 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified (of 5 harvested samples) · 5 pointer-only (licence)To address this limitation, we propose a novel approach that extends the search to larger neighborhoods by learning a destroy-and-repair strategy.
-
5 Feb 2025 1 repository listedThis work represents the first application of Blackout Diffusion to combinatorial optimization, providing a foundation for further advancements in this domain.
-
23 Jan 2025 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 6 harvested samples)To enhance the solution quality while maintaining fast inference, we propose DEITSP, a diffusion model with efficient iterations tailored for TSP that operates in a NAR manner.
-
15 Jan 2025 1 repository listedThis paper proposes a dual divide-and-optimize algorithm (DualOpt) for solving the large-scale traveling salesman problem (TSP).
-
10 Jan 2025 1 repository listedDespite the success of metaheuristic algorithms in solving complex network optimization problems, they often struggle with adaptation, especially in dynamic or high-dimensional search spaces.
-
7 Jan 2025 1 repository listedWe apply our methods to LKH and LKH-3, which is an extension version of LKH that can be used to solve about 40 variant problems of TSP and Vehicle Routing Problem (VRP).
-
28 Oct 2024 1 repository listedIt provides a natural framework to model many situations typical in task planning of all kinds.
-
28 Oct 2024 1 repository listed Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified (of 12 harvested samples)Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints.
-
13 Oct 2024 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified (of 10 harvested samples) · 1 pointer-only (licence)Machine learning has increasingly been employed to solve NP-hard combinatorial optimization problems, resulting in the emergence of neural solvers that demonstrate remarkable performance, even with minimal…
-
29 Aug 2024 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)We can use such a trained GREAT model to produce sparse TSP graph instances, keeping only the edges GREAT finds promising.
-
26 Jun 2024 1 repository listedMultimodal Large Language Models (MLLMs) harness comprehensive knowledge spanning text, images, and audio to adeptly tackle complex problems, including zero-shot in-context learning scenarios.
-
5 Jun 2024 1 repository listedThis article demonstrates the effectiveness of employing a deep learning model in an optimization pipeline.
-
30 May 2024 1 repository listedBy incorporating these ideas, CycleFormer outperforms state-of-the-art (SOTA) transformer models for TSP from TSP-50 to TSP-500.
-
29 May 2024 1 repository listedA random-key optimizer (RKO) uses a vector of random keys to encode a solution to a combinatorial optimization problem.
-
1 May 2024 1 repository listedWe address these issues by reformulating MTSP as a bilevel optimization problem, using the concept of imperative learning (IL).
-
22 Mar 2024 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples) · 5 pointer-only (licence)
-
16 Mar 2024 1 repository listed
-
13 Feb 2024 1 repository listed
-
7 Feb 2024 1 repository listed Syntology official (archive's flag): 9 ran · 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 10 harvested samples)
-
22 Jan 2024 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
27 Nov 2023 1 repository listed
-
17 Nov 2023 1 repository listed
-
27 Oct 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples)
-
24 Oct 2023 1 repository listed
-
20 Oct 2023 1 repository listed
-
6 Oct 2023 1 repository listed
-
1 Aug 2023 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
12 Jul 2023 1 repository listed
-
7 Jun 2023 1 repository listed
-
31 May 2023 1 repository listed Syntology official (archive's flag): 13 ran · 13 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified (of 22 harvested samples) · 2 pointer-only (licence)
-
30 Apr 2023 1 repository listed
-
1 Apr 2023 1 repository listed
-
8 Mar 2023 1 repository listed
-
1 Mar 2023 1 repository listed
-
16 Feb 2023 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified (of 9 harvested samples)
-
12 Oct 2022 1 repository listed
-
8 Oct 2022 1 repository listed Syntology official (archive's flag): 10 ran · 10 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 15 unverified (of 25 harvested samples)
-
17 Jul 2022 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
8 Jul 2022 1 repository listed
-
1 Jun 2022 1 repository listed
-
26 May 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 pointer-only (licence)
-
4 May 2022 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 5 harvested samples)
-
7 Apr 2022 1 repository listed
-
29 Mar 2022 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples)
-
4 Mar 2022 1 repository listed
-
2 Mar 2022 1 repository listed
-
25 Jan 2022 1 repository listed
-
13 Jan 2022 1 repository listed
-
22 Dec 2021 1 repository listed
-
3 Dec 2021 1 repository listed
-
26 Oct 2021 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified (of 11 harvested samples) · 11 pointer-only (licence)
-
15 Oct 2021 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 7 pointer-only (licence)
-
6 Oct 2021 1 repository listed
-
17 Aug 2021 1 repository listed
-
1 Aug 2021 1 repository listed
-
29 Jul 2021 1 repository listed
-
5 Jul 2021 1 repository listed
-
6 May 2021 1 repository listed
-
15 Mar 2021 1 repository listed
-
4 Mar 2021 1 repository listed
-
19 Dec 2020 1 repository listed
-
8 Dec 2020 1 repository listed
-
25 Nov 2020 1 repository listed
-
2 Jun 2020 1 repository listed
-
3 Apr 2020 1 repository listed
-
11 Feb 2020 1 repository listed
-
18 Jan 2020 1 repository listed
-
21 Dec 2018 1 repository listed
-
6 Oct 2018 1 repository listed
-
22 Jan 2018 1 repository listed
-
1 Aug 2017 1 repository listed
-
25 May 2017 1 repository listed
-
29 Sep 2015 1 repository listed
-
8 Sep 2015 1 repository listed
-
19 Feb 2014 1 repository listed
-
14 Mar 2012 1 repository listed
-
Multimodal Fused Learning for Solving the Generalized Traveling Salesman Problem in Robotic Task Planning20 Jun 2025 0 repositories listed
-
RsGCN: Rescaling Enhances Generalization of GCNs for Solving Scalable Traveling Salesman Problems31 May 2025 0 repositories listed
-
Learning for Dynamic Combinatorial Optimization without Training Data26 May 2025 0 repositories listed
-
LMask: Learn to Solve Constrained Routing Problems with Lazy Masking23 May 2025 0 repositories listed
-
Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems21 May 2025 0 repositories listed
-
Preference Optimization for Combinatorial Optimization Problems13 May 2025 0 repositories listed
-
Purity Law for Generalizable Neural TSP Solvers7 May 2025 0 repositories listed
-
The Iterative Chainlet Partitioning Algorithm for the Traveling Salesman Problem with Drone and Neural Acceleration21 Apr 2025 0 repositories listed
-
Large Language Models as Particle Swarm Optimizers12 Apr 2025 0 repositories listed
Syntology lines on 29 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections