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

A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem

Dong, Xueshi*; Lin, Qing; Shen, Fanfan; Guo, Qingteng; Li, Qingshun贵州大学; 青岛大学; 山东大学
Swarm and Evolutionary Computation2023-12DOI: 10.1016/j.swevo.2023.101406
11被引3阅读
引用收藏
分享

摘要

In the fields, such as intelligent transport and multiple tasks cooperation, many real-world problems can be modeled by colored bottleneck traveling salesman problem (CBTSP). Since CBTSP has been proved belong to the NP-hard problems, the population-based algorithms, such as genetic algorithm (GA), hill climbing GA (HCGA) and simulated annealing GA (SAGA), have been used for solving it. However, in term of convergence speed and solution quality, their performances are limited. Moreover, some intelligent algorithms still have the problems such as "black box problem" or lacking theoretical support. Aiming at these problems, this paper proposes a new hybrid simulated annealing algorithm with generating neighborhood solution and crossover operator (GCSA) for CBTSP. In the iterative process of GCSA, the gene coding (dual-chromosome coding) is used to code feasible solutions, and the improved generating neighborhood solution and crossover operator by ITO center dot lemma (Wiener process) are used to explore and exploit new unknown region. During the process, generating neighborhood solution and crossover operator are both controlled by the activity intensity based on Wiener process. The experiments show that GCSA can demonstrate an improvement over the state-of-the-art algorithms for this problem.

学科与关键词

关键词
Hybrid simulated annealingColored bottleneck traveling salesman problemITO LemmaGenerating Neighborhood SolutionCrossover Operator
相关
加载中…
  • Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
    Zhou, Yangming; Xu, Wenqiang; Zhou, Mengchu; Fu, Zhang-Hua*IEEE Transactions on Automation Science and Engineering, 2024, 21(1): 895-905.被引 14
  • Hybrid ITO Algorithm for Large-Scale Colored Traveling Salesman Problem
    Dong, Xueshi*CHINESE JOURNAL OF ELECTRONICS, 2024, 33(6): 1337-1345.
  • Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems
    Zhou, Yangming; Xu, Wenqiang; Fu, Zhang-Hua; Zhou, MengChu*IEEE Transactions on Intelligent Transportation Systems, 2022, 23(9): 16072-16082.被引 58
查看全部 →

发表信息

论文状态
公开发表
期刊
Swarm and Evolutionary Computation
发表日期
2023-12
卷期
第 83 卷
页码
101406
DOI
10.1016/j.swevo.2023.101406
语言
ENGLISH
成果收录
SCIE
资助标注
Shandong Provincial Natural Science Foundation of China [61902189]; Foundation of State Key Laboratory of Public Big Data [20220109]; Basic Science (Natural Science) Research Project of Colleges and Universities in Jiangsu Province [ZR2023MF092, PBD2023-14, 22KJA520004]; Basic Science (Natural Science) Research Project of Colleges and Universities in Jiangsu Province; National Natural Science Foundation of China; Beijing Key Laboratory of Urban Spatial Information Engineering; Shandong Provincial Key Laboratory of Software Engineering (Shandong University); [12371491]

作者

  • D

    Dong, Xueshi (通讯) (第一作者)

    guizhou univ · qingdao univ

  • L

    Lin, Qing

    guizhou univ · qingdao univ

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

    Shen, Fanfan

    nanjing audit univ

  • G

    Guo, Qingteng

    qingdao univ

  • L

    Li, Qingshun

    shandong univ · qingdao univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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