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
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.
Solving the clustered traveling salesman problem with d-relaxed priority rule
University of Technology and Engineering, Vietnam National University(越南国立大学工程技术大学);Interuniversitary Research Centre on Entreprise Networks, Logistics and Transportation (CIRRELT)(企业网络、物流与运输校际研究中心(CIRRELT));Polytechnique Montréal(蒙特利尔理工学院)
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
School of Computer Science, Huazhong University of Science and Technology(华中科技大学计算机科学与技术学院);Institute of Artificial Intelligence, Huazhong University of Science and Technology(华中科技大学人工智能研究院);MIS, University of Picardie Jules Verne(皮卡第儒勒-凡尔纳大学MIS实验室)
Fixed set search applied to the traveling salesman problem
Qatar Environment and Energy Research Institute (QEERI), Hamad bin Khalifa University(哈马德·本·哈利法大学卡塔尔环境与能源研究所);State University of Novi Pazar(新帕扎尔州立大学);University of Hamburg(汉堡大学);Pontificia Universidad Católica de Valparaíso(瓦尔帕莱索天主教大学)
Steiner Traveling Salesman Problem with Quantum Annealing
Department of Mechanical, Energy and Management Engineering, University of Calabria(机械、能源与管理工程系,卡塔尔大学);TECNALIA, Basque Research and Technology Alliance (BRTA)(TECNALIA,巴斯克研究与技术联盟(BRTA))