Traveling Salesman Problem

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.

Most implemented papers archive 2025-07-28

30 shown of 91 papers with code (254 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

• Neural Combinatorial Optimization with Reinforcement Learning
  29 Nov 2016 10 repositories listed Syntology ran 6 of 20 samples · 14 unverified · 5 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.
• Differentiation of Blackbox Combinatorial Solvers
  4 Dec 2019 7 repositories listed
  Achieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence.
• Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model
  4 Jan 2024 6 repositories listed Syntology ran 1 of 1 samples · 0 unverified
  EoH represents the ideas of heuristics in natural language, termed thoughts.
• Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers
  7 Feb 2024 3 repositories listed Syntology ran 10 of 13 samples · 3 unverified
  We also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
• RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
  29 Jun 2023 3 repositories listed Syntology ran 0 of 16 samples · 16 unverified · 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.
• Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks
  6 Sep 2024 2 repositories listed Syntology ran 6 of 7 samples · 1 unverified · 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.
• Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
  5 Jun 2023 2 repositories listed Syntology ran 2 of 2 samples · 0 unverified · 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.
• Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem
  19 Apr 2023 2 repositories listed Syntology ran 2 of 3 samples · 1 unverified · 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…
• Backpropagation through Combinatorial Algorithms: Identity with Projection Works
  30 May 2022 2 repositories listed
  Embedding discrete solvers as differentiable layers has given modern deep learning architectures combinatorial expressivity and discrete reasoning capabilities.
• Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer
  6 Oct 2021 2 repositories listed Syntology ran 9 of 16 samples · 7 unverified
  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.
• Exploring the Loss Landscape in Neural Architecture Search
  6 May 2020 2 repositories listed Syntology ran 2 of 2 samples · 0 unverified · 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…
• Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning
  12 Nov 2019 2 repositories listed Syntology ran 0 of 9 samples · 9 unverified
  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…
• Donkey and Smuggler Optimization Algorithm: A Collaborative Working Approach to Path Finding
  19 Apr 2019 2 repositories listed
  These are the Smuggler and Donkeys.
• Collaborative Problem-Solving in an Optimization Game
  21 May 2025 1 repository listed
  Dialogue agents that support human users in solving complex tasks have received much attention recently.
• Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems
  5 Mar 2025 1 repository listed
  Recent works focus only on well-known combinatorial optimization problems like the traveling salesman problem and online bin packing problem when designing constructive heuristics.
• Destroy and Repair Using Hyper Graphs for Routing
  22 Feb 2025 1 repository listed Syntology ran 2 of 5 samples · 3 unverified · 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.
• Blackout DIFUSCO
  5 Feb 2025 1 repository listed
  This work represents the first application of Blackout Diffusion to combinatorial optimization, providing a foundation for further advancements in this domain.
• An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem
  23 Jan 2025 1 repository listed Syntology ran 1 of 6 samples · 5 unverified
  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.
• DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem
  15 Jan 2025 1 repository listed
  This paper proposes a dual divide-and-optimize algorithm (DualOpt) for solving the large-scale traveling salesman problem (TSP).
• ELENA: Epigenetic Learning through Evolved Neural Adaptation
  10 Jan 2025 1 repository listed
  Despite the success of metaheuristic algorithms in solving complex network optimization problems, they often struggle with adaptation, especially in dynamic or high-dimensional search spaces.
• Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
  7 Jan 2025 1 repository listed
  We 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).
• Learning to Handle Complex Constraints for Vehicle Routing Problems
  28 Oct 2024 1 repository listed Syntology ran 2 of 12 samples · 10 unverified
  Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints.
• Optimal planning for heterogeneous autonomous teams with precedence and compatibility constraints and its application on power grid inspection with Unmanned Aerial Vehicles
  28 Oct 2024 1 repository listed
  It provides a natural framework to model many situations typical in task planning of all kinds.
• Neural Solver Selection for Combinatorial Optimization
  13 Oct 2024 1 repository listed Syntology ran 6 of 10 samples · 4 unverified
  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…
• A GREAT Architecture for Edge-Based Graph Problems Like TSP
  29 Aug 2024 1 repository listed Syntology ran 1 of 1 samples · 0 unverified · 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.
• Visual Reasoning and Multi-Agent Approach in Multimodal Large Language Models (MLLMs): Solving TSP and mTSP Combinatorial Challenges
  26 Jun 2024 1 repository listed
  Multimodal Large Language Models (MLLMs) harness comprehensive knowledge spanning text, images, and audio to adeptly tackle complex problems, including zero-shot in-context learning scenarios.
• Graph Convolutional Branch and Bound
  5 Jun 2024 1 repository listed
  This article demonstrates the effectiveness of employing a deep learning model in an optimization pipeline.
• CycleFormer : TSP Solver Based on Language Modeling
  30 May 2024 1 repository listed
  By incorporating these ideas, CycleFormer outperforms state-of-the-art (SOTA) transformer models for TSP from TSP-50 to TSP-500.
• A random-key GRASP for combinatorial optimization
  29 May 2024 1 repository listed
  A random-key optimizer (RKO) uses a vector of random keys to encode a solution to a combinatorial optimization problem.
• iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
  1 May 2024 1 repository listed
  We address these issues by reformulating MTSP as a bilevel optimization problem, using the concept of imperative learning (IL).

Syntology lines on 15 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. Read from the graph 2026-09-24.