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

An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem

Tang, Kezong; Wei, Xiong-Fei*; Jiang, Yuan-Hao*; Chen, Zi-Wei; Yang, Lihua
Mathematics2023-11DOI: 10.3390/math11214439
1被引7阅读
引用收藏
分享

摘要

The ant colony algorithm faces dimensional catastrophe problems when solving the large-scale traveling salesman problem, which leads to unsatisfactory solution quality and convergence speed. To solve this problem, an adaptive ant colony optimization for large-scale traveling salesman problem (AACO-LST) is proposed. First, AACO-LST improves the state transfer rule to make it adaptively adjust with the population evolution, thus accelerating its convergence speed; then, the 2-opt operator is used to locally optimize the part of better ant paths to further optimize the solution quality of the proposed algorithm. Finally, the constructed adaptive pheromone update rules can significantly improve the search efficiency and prevent the algorithm from falling into local optimal solutions or premature stagnation. The simulation based on 45 traveling salesman problem instances shows that AACO-LST improves the solution quality by 79% compared to the ant colony system (ACS), and in comparison with other algorithms, the PE of AACO-LST is not more than 1% and the Err is not more than 2%, which indicates that AACO-LST can find high-quality solutions with high stability. Finally, the convergence speed of the proposed algorithm was tested. The data shows that the average convergence speed of AACO-LST is more than twice that of the comparison algorithm. The relevant code can be found on our project homepage.

学科与关键词

关键词
meta-heuristic algorithmadaptive optimizationtraveling salesman problemlarge-scale optimizationpath optimization
相关
加载中…
  • An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman Problem
    Du, Pengzhen*; Liu, Ning; Zhang, Haofeng; Lu, JianfengJOURNAL OF ADVANCED TRANSPORTATION, 2021, 2021: 6642009.被引 11
  • Adaptive Ant Colony Optimization with node clustering applied to the Travelling Salesman Problem
    Stodola, Petr*; Otrisal, Pavel; Hasilova, KamilaSwarm and Evolutionary Computation, 2022, 70: 101056.被引 33
  • Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategy
    Li, Shundong; You, Xiaoming*; Liu, ShengApplied Intelligence, 2021, 51(8): 5644-5664.被引 13
查看全部 →

发表信息

论文状态
公开发表
期刊
Mathematics
发表日期
2023-11
卷期
第 11 卷, 第 21 期
页码
4439
DOI
10.3390/math11214439
成果收录
SCIE
资助标注
National Innovation Training Program for College Students [202210408015]; Science and Technology Research Project of Jiangxi Provincial Department of Education [GJJ211331]

作者

  • T

    Tang, Kezong (第一作者)

  • W

    Wei, Xiong-Fei (通讯)

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

    Jiang, Yuan-Hao (通讯)

  • C

    Chen, Zi-Wei

  • Y

    Yang, Lihua

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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