Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP
Tongkai Lu, Shuai Ma, Chongyang Tao

TL;DR
This paper introduces Hyper Tour Guided Neighborhood Search (HyperNS), a novel method for large-scale TSP that improves efficiency and solution quality by clustering and hyper tour guidance, outperforming existing neural-based approaches.
Contribution
The paper presents a hyper tour guided neighborhood search method that effectively scales neural-based TSP solutions to larger instances by clustering and hyper tour guidance.
Findings
Outperforms existing neural-based methods on large-scale TSP datasets.
Reduces the solution gap significantly compared to prior approaches.
Efficiently handles larger instances with improved solution quality.
Abstract
Traveling Salesman Problem (TSP) is a classic NP-hard problem that has garnered significant attention from both academia and industry. While neural-based methods have shown promise for solving TSPs, they still face challenges in scaling to larger instances, particularly in memory constraints associated with global heatmaps, edge weights, or access matrices, as well as in generating high-quality initial solutions and insufficient global guidance for efficiently navigating vast search spaces. To address these challenges, we propose a Hyper Tour Guided Neighborhood Search (HyperNS) method for large-scale TSP instances. Inspired by the ``clustering first, route second" strategy, our approach initially divides the TSP instance into clusters using a sparse heatmap graph and abstracts them as supernodes, followed by the generation of a hyper tour to guide both the initialization and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
