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

A transfer learning-based particle swarm optimization algorithm for travelling salesman problem

Zheng, Rui-zhao; Zhang, Yong*; Yang, Kang吉林大学
Journal of Computational Design and Engineering2022-5-23DOI: 10.1093/jcde/qwac039
25被引1阅读
引用收藏
分享

摘要

To solve travelling salesman problems (TSPs), most existing evolutionary algorithms search for optimal solutions from zero initial information without taking advantage of the historical information of solving similar problems. This paper studies a transfer learning-based particle swarm optimization (PSO) algorithm, where the optimal information of historical problems is used to guide the swarm to find optimal paths quickly. To begin with, all cities in the new and historical TSP problems are clustered into multiple city subsets, respectively, and a city topology matching strategy based on geometric similarity is proposed to match each new city subset to a historical city subset. Then, on the basis of the above-matched results, a hierarchical generation strategy of the feasible path (HGT) is proposed to initialize the swarm to improve the performance of PSO. Moreover, a problem-specific update strategy, i.e. the particle update strategy with adaptive crossover and clustering-guided mutation, is introduced to enhance the search capability of the proposed algorithm. Finally, the proposed algorithm is applied to 20 typical TSP problems and compared with 12 state-of-the-art algorithms. Experimental results show that the transfer learning mechanism can accelerate the search efficiency of PSO and make the proposed algorithm achieve better optimal paths.

学科与关键词

关键词
evolutionary computationparticle swarm optimizationtravelling salesman problem
相关
加载中…
  • A Twin Learning Framework for Traveling Salesman Problem Based on Autoencoder, Graph Filter, and Transfer Learning
    Wu, Junjun; Yang, Hanshi; Zeng, Yan; Wu, Zhou*; Liu, Jiepeng; Feng, LiangIEEE Transactions on Consumer Electronics, 2024, 70(1): 3245-3258.被引 3
  • Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem
    Zhong, Yiwen*; Lin, Juan; Wang, Lijin; Zhang, HuiSwarm and Evolutionary Computation, 2018, 42: 77-88.被引 78
  • Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems
    Zheng, Jiongzhi; He, Kun*; Zhou, Jianrong; Jin, Yan; Li, Chu-MinKnowledge-Based Systems, 2023, 260: 110144.被引 18
查看全部 →

发表信息

论文状态
公开发表
期刊
Journal of Computational Design and Engineering
发表日期
2022-05-23
卷期
第 9 卷, 第 3 期
页码
933-948
DOI
10.1093/jcde/qwac039
期刊等级
2区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61876185]; Fundamental Research Funds for Central Universities, JLU [93K172021K16]

作者

  • Z

    Zheng, Rui-zhao (第一作者)

  • Z

    Zhang, Yong (通讯)

    jilin univ

查看全部 3 位作者收起作者
  • Y

    Yang, Kang

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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