Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum

04/07/2022
by   Zeyang Zhang, et al.
0

Various neural network models have been proposed to tackle combinatorial optimization problems such as the travelling salesman problem (TSP). Existing learning-based TSP methods adopt a simple setting that the training and testing data are independent and identically distributed. However, the existing literature fails to solve TSP instances when training and testing data have different distributions. Concretely, we find that different training and testing distribution will result in more difficult TSP instances, i.e., the solution obtained by the model has a large gap from the optimal solution. To tackle this problem, in this work, we study learning-based TSP methods when training and testing data have different distributions using adaptive-hardness, i.e., how difficult a TSP instance can be for a solver. This problem is challenging because it is non-trivial to (1) define hardness measurement quantitatively; (2) efficiently and continuously generate sufficiently hard TSP instances upon model training; (3) fully utilize instances with different levels of hardness to learn a more powerful TSP solver. To solve these challenges, we first propose a principled hardness measurement to quantify the hardness of TSP instances. Then, we propose a hardness-adaptive generator to generate instances with different hardness. We further propose a curriculum learner fully utilizing these instances to train the TSP solver. Experiments show that our hardness-adaptive generator can generate instances ten times harder than the existing methods, and our proposed method achieves significant improvement over state-of-the-art models in terms of the optimality gap.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2021

A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances

In recent years, we have witnessed tremendous progress in deep reinforce...
research
08/06/2023

VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs

Data-driven approaches have been proven effective in solving combinatori...
research
08/27/2019

Hardness Amplification of Optimization Problems

In this paper, we prove a general hardness amplification scheme for opti...
research
07/07/2020

Curriculum learning for multilevel budgeted combinatorial problems

Learning heuristics for combinatorial optimization problems through grap...
research
02/26/2019

Learning to Find Hard Instances of Graph Problems

Finding hard instances, which need a long time to solve, of graph proble...
research
11/16/2022

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

Decades of research on the 0-1 knapsack problem led to very efficient al...
research
12/04/2022

Characterizing instance hardness in classification and regression problems

Some recent pieces of work in the Machine Learning (ML) literature have ...

Please sign up or login with your details

Forgot password? Click here to reset