Neural TSP Solver with Progressive Distillation

Travelling salesman problem (TSP) is NP-Hard with exponential search space. Recently, the adoption of encoder-decoder models as neural TSP solvers has emerged as an attractive topic because they can instantly obtain near-optimal results for small-scale instances. Nevertheless, their training efficiency and solution quality degrade dramatically when dealing with large-scale problems. To address the issue, we propose a novel progressive distillation framework, by adopting curriculum learning to train TSP samples in increasing order of their problem size and progressively distilling high-level knowledge from small models to large models via a distillation loss. In other words, the trained small models are used as the teacher network to guide action selection when training large models. To accelerate training speed, we also propose a Delaunary-graph based action mask and a new attention-based decoder to reduce decoding cost. Experimental results show that our approach establishes clear advantages over existing encoder-decoder models in terms of training effectiveness and solution quality. In addition, we validate its usefulness as an initial solution generator for the state-of-the-art TSP solvers, whose probability of obtaining the optimal solution can be further improved in such a hybrid manner.

Authors

• Dongxiang Zhang Zhejiang University
• Ziyang Xiao Zhejiang University
• Yuan Wang National Key Laboratory of Cognition and Decision Intelligence for Complex Systems, CASIA & School of Artificial Intelligence, UCAS
• Mingli Song Zhejiang University
• Gang Chen

Keywords

• ML: Reinforcement Learning Algorithms
• PRS: Planning/Scheduling and Learning