LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solvers
Not on the map. Why?
Abstract (arXiv)
Neural solvers have shown significant potential in solving the Traveling Salesman Problem (TSP), yet current approaches face significant challenges. Supervised learning (SL)-based solvers require large amounts of high-quality labeled data, while reinforcement learning (RL)-based solvers, though less dependent on such data, often suffer from inefficiencies. To address these limitations, we propose LocalEscaper, a novel weakly-supervised learning framework for large-scale TSP. LocalEscaper effectively combines the advantages of both SL and RL, enabling effective training on datasets with low-quality labels. To further enhance solution quality, we introduce a regional reconstruction strategy, which is the key technique of this paper and mitigates the local-optima problem common in existing local reconstruction methods. Experimental results on both synthetic and real-world datasets demonstrate that LocalEscaper outperforms existing neural solvers, achieving remarkable results.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 18 Feb 2025.
Builds on
24 of 46 references.
References · 24
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Pointer Networkscited by 882
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
- 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 341
- 2019An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problemcited by 265
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
- 2020Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instancescited by 161
- 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
- 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
12 more
- 2021NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problemcited by 102
- 2023GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-timecited by 82
- 2023BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimizationcited by 80
- 2023Unsupervised Learning for Solving the Travelling Salesman Problemcited by 57
- 2023Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problemcited by 49
- 2024UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problemscited by 45
- 2023H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problemcited by 43
- 2024INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformercited by 43
- 2024Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvementcited by 32
- 2024Self-Improved Learning for Scalable Neural Combinatorial Optimizationcited by 29
- 2024Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problemscited by 24
- 2022Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problemscited by 12
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.