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

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, Liang重庆大学
IEEE Transactions on Consumer Electronics2024-2DOI: 10.1109/TCE.2023.3269071
3被引2阅读
引用收藏
分享

摘要

Efficient solvers for traveling salesman problem (TSP) have great significance in the field of consumer electronic systems and devices. Existing studies require independent and repetitive runs for similar TSPs. To utilize useful knowledge buried in the twin TSP which is similar to the target TSP, a twin learning framework based on task matching and mapping strategy is proposed. We use an autoencoder to extract the feature vectors of the historical tasks and the target task to find the twin task. If not found, construct a twin task based on a graph-filter. Further, we get the solution of the target task with the optimized twin task by learning a mapping matrix from the twin task to the target task. Finally, we incorporate local search algorithms into the twin learning framework, which called strategy mapping solver (SMS) to further improve the quality of the solution. The efficacy of the SMS is evaluated through comprehensive empirical studies with commonly used TSP benchmarks, against meta-heuristic algorithms and a learning improvement heuristics algorithm, demonstrating its effectiveness for TSP. Moreover, a real-world combinatorial optimization application, laser engraving path planning, is presented to further confirm the efficacy of SMS.

学科与关键词

关键词
Task analysisUrban areasOptimizationHeuristic algorithmsMetaheuristicsStatisticsSociologyTraveling salesman problemtwin learningautoencodergraph-filterpath planning
相关
加载中…
  • A transfer learning-based particle swarm optimization algorithm for travelling salesman problem
    Zheng, Rui-zhao; Zhang, Yong*; Yang, KangJournal of Computational Design and Engineering, 2022, 9(3): 933-948.被引 25
  • 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
  • How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem
    Liu, Shengcai; Zhang, Yu; Tang, Ke*; Yao, XinIEEE Computational Intelligence Magazine, 2023, 18(3): 14-28.被引 15
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Consumer Electronics
发表日期
2024-02
卷期
第 70 卷, 第 1 期
页码
3245-3258
DOI
10.1109/TCE.2023.3269071
语言
ENGLISH
成果收录
SCIE
资助标注
National Key Research and Development Program of China

作者

  • W

    Wu, Junjun (第一作者)

    chongqing univ

  • Y

    Yang, Hanshi

    chongqing univ

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

    Zeng, Yan

    chongqing univ

  • W

    Wu, Zhou (通讯)

    chongqing univ

  • L

    Liu, Jiepeng

    chongqing univ

  • F

    Feng, Liang

    chongqing univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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