Traveling Salesman Problem

22 papers with code • 1 benchmarks • 1 datasets

This task has no description! Would you like to contribute one?

Greatest papers with code

Differentiation of Blackbox Combinatorial Solvers

martius-lab/blackbox-backprop ICLR 2020

Achieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence.

Traveling Salesman Problem

Local Search is State of the Art for Neural Architecture Search Benchmarks

naszilla/naszilla 6 May 2020

Local search is one of the simplest families of algorithms in combinatorial optimization, yet it yields strong approximation guarantees for canonical NP-Complete problems such as the traveling salesman problem and vertex cover.

Combinatorial Optimization Hyperparameter Optimization +2

Neural Combinatorial Optimization with Reinforcement Learning

MichelDeudon/neural-combinatorial-optimization-rl-tensorflow 29 Nov 2016

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.

Combinatorial Optimization Traveling Salesman Problem

Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning

qiang-ma/graph-pointer-network 12 Nov 2019

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 optimal city permutation under constraints.

Combinatorial Optimization Graph Embedding +2

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

qcappart/hybrid-cp-rl-solver 2 Jun 2020

In this work, we propose a general and hybrid approach, based on DRL and CP, for solving combinatorial optimization problems.

Combinatorial Optimization Portfolio Optimization +1

The Transformer Network for the Traveling Salesman Problem

xbresson/TSP_Transformer 4 Mar 2021

The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial problem, starting with von Neumann in 1951.

Traveling Salesman Problem

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances

Spider-scnu/TSP 19 Dec 2020

For the traveling salesman problem (TSP), the existing supervised learning based algorithms suffer seriously from the lack of generalization ability.

Graph Sampling Traveling Salesman Problem

A Powerful Genetic Algorithm for Traveling Salesman Problem

sugia/GA-for-TSP 19 Feb 2014

This paper presents a powerful genetic algorithm(GA) to solve the traveling salesman problem (TSP).

Traveling Salesman Problem

Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning

paulorocosta/learning-2opt-drl 3 Apr 2020

We propose a policy gradient algorithm to learn a stochastic policy that selects 2-opt operations given a current solution.

Traveling Salesman Problem