ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems

Zheng, Jiongzhi; He, Kun*; Zhou, Jianrong; Jin, Yan; Li, Chu-Min华中科技大学
Knowledge-Based Systems2023-1-25DOI: 10.1016/j.knosys.2022.110144
18被引4阅读
引用收藏
分享

摘要

The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial optimization problem with many practical variants. The Lin-Kernighan-Helsgaun (LKH) algorithm is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a powerful extension of LKH that can solve many TSP variants. Both LKH and LKH-3 use the candidate sets to improve their efficiency, and have two different methods, alpha-measure and POPMUSIC, to decide the candidate sets. In this work, we first propose a Variable Strategy Reinforced LKH (VSR-LKH) algorithm, which incorporates three reinforcement learning methods (Q-learning, Sarsa, and Monte Carlo) with LKH, for the TSP. We further propose a new algorithm called VSR-LKH-3 that combines the variable strategy reinforcement learning method with LKH-3 for typical TSP variants, including the TSP with Time Windows (TSPTW) and the Colored TSP (CTSP). The proposed algorithms replace the inflexible traversal operations in LKH and LKH-3 and let the algorithms learn to make a choice at each search step by reinforcement learning. Both LKH and LKH-3, with either the alpha-measure or the POPMUSIC method, can be significantly improved by our methods. Extensive experiments on 236 widely-used TSP benchmarks with up to 85,900 cities demonstrate the excellent performance of VSR-LKH. VSR-LKH-3 also significantly outperforms the state-of-the-art heuristics for the TSPTW and CTSP.

学科与关键词

关键词
Traveling salesman problemsReinforcement learningLin-Kernighan-Helsgaun algorithmLocal searchVariable strategy search
相关
加载中…
  • Reinforcement learning for the traveling salesman problem with refueling
    Ottoni, Andre L. C.*; Nepomuceno, Erivelton G.; Oliveira, Marcos S. de; Oliveira, Daniela C. R. deComplex & Intelligent Systems, 2022, 8(3): 2001-2015.被引 25
  • Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning
    Zhang, Zizhen; Liu, Hong*; Zhou, MengChu; Wang, JiahaiIEEE Transactions on Neural Networks and Learning Systems, 2023, 34(4): 2119-2132.被引 50
  • Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem
    Zhang, Jin*; Liu, Qing; Han, XiaoHangPLoS One, 2023, 18(3): e0283207.被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
Knowledge-Based Systems
发表日期
2023-01-25
卷期
第 260 卷
页码
110144
DOI
10.1016/j.knosys.2022.110144
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [62076105]; Microsoft Research Asia [100338928]

作者

  • Z

    Zheng, Jiongzhi (第一作者)

    huazhong univ sci & technol

  • H

    He, Kun (通讯)

    huazhong univ sci & technol

查看全部 5 位作者收起作者
  • Z

    Zhou, Jianrong

    huazhong univ sci & technol

  • J

    Jin, Yan

    huazhong univ sci & technol

  • L

    Li, Chu-Min

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417