NeuralGLS: learning to guide local search with graph convolutional network for the traveling salesman problem

被引:2
作者
Sui, Jingyan [1 ,2 ]
Ding, Shizhe [1 ,2 ]
Xia, Boyang [1 ,2 ]
Liu, Ruizhi [1 ,2 ]
Bu, Dongbo [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Kexueyuan South Rd, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Yanqihu East Rd, Beijing 101408, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph convolutional network; Guided local search; Traveling salesman problem;
D O I
10.1007/s00521-023-09042-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The traveling salesman problem (TSP) aims to find the shortest tour that visits each node of a given graph exactly once. TSPs have significant importance as numerous practical problems can be naturally formulated as TSPs. Various algorithms have been developed for solving TSPs, including combinatorial optimization algorithms and deep learning-based approaches. However, these algorithms often face a trade-off between providing exact solutions with long running times and delivering fast but approximate solutions. Therefore, achieving both efficiency and solution quality simultaneously remains a major challenge. In this study, we propose a data-driven algorithm called NeuralGLS to address this challenge. NeuralGLS is a hybrid algorithm that combines deep learning techniques with guided local search (GLS). It incorporates a self-adaptive graph convolutional network (GCN) that takes into account neighborhoods of varying sizes, accommodating TSP instances with different graph sizes. This GCN calculates a regret value for each edge in a given TSP instance. Subsequently, the algorithm utilizes a mixed strategy to construct an initial tour and then employs a GLS module to iteratively improve the tour guided by the acquired regret values until a high-quality tour is obtained. Experimental results on diverse benchmark datasets and real-world TSP instances demonstrate the effectiveness of NeuralGLS in generating high-quality solutions within reasonable computation time. Furthermore, when compared to several state-of-the-art algorithms, our NeuralGLS algorithm exhibits superior generalization performance on both real-world and larger-scale TSP instances. Notably, NeuralGLS also outperforms another hybrid algorithm that also incorporates GLS by reducing the mean optimality gap for real-world TSP instances from 1.318% to 0.958%, with both methods achieving results within the same computation time. This remarkable improvement in solution quality amounts to an impressive relative enhancement of 27.31%.
引用
收藏
页码:9687 / 9706
页数:20
相关论文
共 39 条
  • [1] [Anonymous], 1997, Local search in combinatorial optimization
  • [2] Applegate D., 2006, CONCORDE TSP SOLVER
  • [3] Bello I., 2016, Neural combinatorial optimization with reinforcement learning, DOI 10.48550/arXiv.1611.09940
  • [4] Machine learning for combinatorial optimization: A methodological tour d'horizon
    Bengio, Yoshua
    Lodi, Andrea
    Prouvost, Antoine
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (02) : 405 - 421
  • [5] Cook W. J., 2012, In pursuit of the traveling salesman. Mathematics at the limits of computation
  • [6] da Costa Paulo, 2020, Proceedings of the 12th Asian Conference on Machine Learning, P465
  • [7] Dai HJ, 2018, Arxiv, DOI arXiv:1704.01665
  • [8] SOLUTION OF A LARGE-SCALE TRAVELING-SALESMAN PROBLEM
    DANTZIG, G
    FULKERSON, R
    JOHNSON, S
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF AMERICA, 1954, 2 (04): : 393 - 410
  • [9] Learning Heuristics for the TSP by Policy Gradient
    Deudon, Michel
    Cournut, Pierre
    Lacoste, Alexandre
    Adulyasak, Yossiri
    Rousseau, Louis-Martin
    [J]. INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 170 - 181
  • [10] Fu ZH, 2021, AAAI CONF ARTIF INTE, V35, P7474