DeepAI AI Chat
Log In Sign Up

Travel the Same Path: A Novel TSP Solving Strategy

by   Pingbang Hu, et al.
University of Michigan

In this paper, we provide a novel strategy for solving Traveling Salesman Problem, which is a famous combinatorial optimization problem studied intensely in the TCS community. In particular, we consider the imitation learning framework, which helps a deterministic algorithm making good choices whenever it needs to, resulting in a speed up while maintaining the exactness of the solution without suffering from the unpredictability and a potential large deviation. Furthermore, we demonstrate a strong generalization ability of a graph neural network trained under the imitation learning framework. Specifically, the model is capable of solving a large instance of TSP faster than the baseline while has only seen small TSP instances when training.


page 1

page 2

page 3

page 4


Yordle: An Efficient Imitation Learning for Branch and Bound

Combinatorial optimization problems have aroused extensive research inte...

Provable Representation Learning for Imitation Learning via Bi-level Optimization

A common strategy in modern learning systems is to learn a representatio...

Imitation Learning of Stabilizing Policies for Nonlinear Systems

There has been a recent interest in imitation learning methods that are ...

Learning chordal extensions

A highly influential ingredient of many techniques designed to exploit s...

Meta learning Framework for Automated Driving

The success of automated driving deployment is highly depending on the a...

Learning to Extrapolate: A Transductive Approach

Machine learning systems, especially with overparameterized deep neural ...

Solving Graph-based Public Good Games with Tree Search and Imitation Learning

Public goods games represent insightful settings for studying incentives...

Code Repositories


Travel the Same Path: A TSP Solving Strategy.

view repo