Browse SoTA > Traveling Salesman Problem

Traveling Salesman Problem

16 papers with code ·

Benchmarks

Greatest papers with code

Differentiation of Blackbox Combinatorial Solvers

ICLR 2020 martius-lab/blackbox-backprop

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

6 May 2020naszilla/naszilla

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 NEURAL ARCHITECTURE SEARCH TRAVELING SALESMAN PROBLEM

Neural Combinatorial Optimization with Reinforcement Learning

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

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

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

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 HIERARCHICAL REINFORCEMENT LEARNING TRAVELING SALESMAN PROBLEM

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

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

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

COMBINATORIAL OPTIMIZATION PORTFOLIO OPTIMIZATION TRAVELING SALESMAN PROBLEM

A Powerful Genetic Algorithm for Traveling Salesman Problem

19 Feb 2014sugia/GA-for-TSP

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

3 Apr 2020paulorocosta/learning-2opt-drl

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

TRAVELING SALESMAN PROBLEM

Learning to Align the Source Code to the Compiled Object Code

ICML 2017 DorLevyML/learn-align

We propose a new neural network architecture and use it for the task of statement-by-statement alignment of source code and its compiled object code.

TRAVELING SALESMAN PROBLEM

A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem

11 Feb 2020jonatasbcchagas/nds-brkga_bi-ttp

In this paper, we propose a method to solve a bi-objective variant of the well-studied Traveling Thief Problem (TTP).

TRAVELING SALESMAN PROBLEM