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

An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem

Wang, Zicheng; Geng, Xiutang; Shao, Zehui*华中科技大学
Journal of Computational and Theoretical Nanoscience2009-7DOI: 10.1166/jctn.2009.1230
27被引4阅读
引用收藏
分享

摘要

It is well known that the traveling salesman problem (TSP) is one of the most studied NP-complete problems, and evolutionary technique such as simulated annealing has mostly been used to solve various NP-complete problems. In this paper, a two-stage simulated annealing (two-stage SA) algorithm is proposed to solve the TSP, and the two-stage SA algorithm is made up of two stages. In the first stage, a simple simulated annealing (simple SA) algorithm is proposed to obtain some appropriate solutions or closed tours. In the second stage, an effective simulated annealing (effective SA) algorithm is proposed to obtain solutions with good quality based on the solutions or closed tours obtained by the simple SA algorithm. To assess the effectiveness of the two-stage SA algorithm, simulations were carried out on 23 benchmark TSP instances. The simulation results show that the two-stage SA algorithm can obtain solutions with better quality than four recent algorithms such as ant colony optimization algorithm, self-organizing maps algorithm, particle swarm optimization algorithm and constructive optimizer neural network algorithm.

学科与关键词

关键词
Simulated Annealing AlgorithmNP-Complete ProblemTraveling Salesman ProblemGreedy Search
相关
加载中…
  • Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
    Geng, Xiutang*; Chen, Zhihua; Yang, Wei; Shi, Deqian; Zhao, KaiAPPLIED SOFT COMPUTING, 2011, 11(4): 3680-3689.被引 158
  • Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem
    Wang, Lijin; Cai, Rongying; Lin, Min; Zhong, Yiwen*IEEE Access, 2019, 7: 144366-144380.被引 20
  • A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
    Dong, Xueshi*; Lin, Qing; Shen, Fanfan; Guo, Qingteng; Li, QingshunSwarm and Evolutionary Computation, 2023, 83: 101406.被引 11
查看全部 →

发表信息

论文状态
公开发表
期刊
Journal of Computational and Theoretical Nanoscience
发表日期
2009-07
卷期
第 6 卷, 第 7 期
页码
1680-1686
DOI
10.1166/jctn.2009.1230
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [60373089, 60674106, 60533010]; New Century Excellent Talents in University [NCET-05-0612]; Ministry of Education of China [20060487014]; Chenguang Program of Wuhan [200750731262]; National High Technology Research and Development 863 Program [2006AA01Z104]

作者

  • W

    Wang, Zicheng (第一作者)

    huazhong univ sci & technol

  • G

    Geng, Xiutang

    huazhong univ sci & technol

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

    Shao, Zehui (通讯)

    chengdu univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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