AI RESEARCH
Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP
arXiv CS.LG
•
ArXi:2510.20169v3 Announce Type: replace 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.