arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.08565cs.AI
收藏

DualOpt:一种求解大规模旅行商问题的对偶分治优化算法

DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem

School of Computer Science, Huazhong University of Science and Technology(华中科技大学计算机学院);School of Computing and Information Systems, Singapore Management University(新加坡管理大学计算与信息系统学院)

Shipei Zhou, Yuandong Ding, Chi Zhang, Zhiguang Cao, Yan Jin

AI总结:

针对大规模旅行商问题,本文提出结合网格分治与路径分治优化的DualOpt算法,在多类基准上取得优于现有算法的效果与效率。

摘要:

本文提出了一种对偶分治优化算法(DualOpt),用于求解大规模旅行商问题(TSP)。DualOpt结合了两种互补策略,以同时提升解的质量和计算效率。第一种策略是基于网格的分治流程:将TSP划分为更小的子问题,并行求解这些子问题,并通过合并节点与部分路径迭代优化解;该过程持续到仅剩下一个网格,从而得到高质量的初始解。第二种策略涉及基于路径的分治优化流程:将当前解划分为若干子路径,使用神经求解器优化每个子路径,再将其合并,以逐步提升整体解的质量。\n本文在两组TSP基准实例上开展了大量实验,包括节点数最多达100000的随机生成实例,以及来自TSPLIB的真实数据集,实验结果证明了DualOpt的有效性。与文献中10种最先进算法相比,所提出的DualOpt取得了极具竞争力的结果。尤其是在最大的实例TSP100K上,DualOpt的优化提升幅度最高达1.40%,且相较于领先的启发式求解器LKH3,实现了高达104倍的加速。此外,DualOpt在TSPLIB基准上展现出很强的泛化能力,证实了其可应对多样化的真实世界TSP应用。

英文摘要:

This paper proposes a dual divide-and-optimize algorithm (DualOpt) for solving the large-scale traveling salesman problem (TSP). DualOpt combines two complementary strategies to improve both solution quality and computational efficiency. The first strategy is a grid-based divide-and-conquer procedure that partitions the TSP into smaller sub-problems, solving them in parallel and iteratively refining the solution by merging nodes and partial routes. The process continues until only one grid remains, yielding a high-quality initial solution. The second strategy involves a path-based divide-and-optimize procedure that further optimizes the solution by dividing it into sub-paths, optimizing each using a neural solver, and merging them back to progressively improve the overall solution. Extensive experiments conducted on two groups of TSP benchmark instances, including randomly generated instances with up to 100,000 nodes and real-world datasets from TSPLIB, demonstrate the effectiveness of DualOpt. The proposed DualOpt achieves highly competitive results compared to 10 state-of-the-art algorithms in the literature. In particular, DualOpt achieves an improvement gap up to 1.40% for the largest instance TSP100K with a remarkable 104x speed-up over the leading heuristic solver LKH3. Additionally, DualOpt demonstrates strong generalization on TSPLIB benchmarks, confirming its capability to tackle diverse real-world TSP applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑