通过超旅行引导实现大规模TSP的定向邻域搜索
Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP
AI总结:
本文提出HyperNS方法,通过稀疏热力图图划分和超旅行生成,有效减少搜索空间,提升大规模TSP求解效率,实验表明在处理大实例时性能优于现有神经方法。
摘要:
旅行商问题(TSP)是一个经典NP难问题,已引起学术界和工业界广泛关注。尽管基于神经的方法在求解TSP方面表现出色,但在处理大规模实例时仍面临内存限制、全局热图、边权重或访问矩阵的挑战,以及生成高质量初始解和缺乏全局指导以高效导航广阔搜索空间的问题。为解决这些问题,我们提出了一种超旅行引导的邻域搜索(HyperNS)方法,用于大规模TSP实例。受“聚类优先,路线其次”策略的启发,我们的方法首先使用稀疏热力图图将TSP实例划分为聚类,并将其抽象为超节点,然后生成超旅行以指导初始化和优化过程。该方法通过聚焦与超旅行相关的边来减少搜索空间,从而实现更高效和有效的优化。在合成和现实数据集上的实验结果表明,我们的方法在处理大规模实例时优于现有神经方法,显著减少了到最优解的差距。
英文摘要:
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 optimization processes. This method reduces the search space by focusing on edges relevant to the hyper tour, leading to more efficient and effective optimization. Experimental results on both synthetic and real-world datasets demonstrate that our approach outperforms existing neural-based methods, particularly in handling larger-scale instances, offering a significant reduction in the gap to the optimal solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。