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

Hybrid IT? Algorithm for Maximum Scatter Colored Traveling Salesman Problem

Dong, Xueshi*; Lin, Qing; Wang, Wei贵州大学; 青岛大学
COMPUTER JOURNAL2024-1-14DOI: 10.1093/comjnl/bxad131
2被引2阅读
引用收藏
分享

摘要

This research presents a new problem maximum scatter colored traveling salesman problem (MSCTSP), the objective of MSCTSP is to find Hamiltonian cycles with the minimal edge as max as possible, it is used to simulate the real-world applications of network and transport. Since MSCTSP has been proved to be a NP-hard problem, population-based algorithms can be used for solving it. However, the performances are not satisfactory. Thus, it is necessary to develop novel algorithms to obtain high quality feasible solution. Based on the above reason, the paper proposes a novel hybrid ITo (HITo) algorithm, which integrates the two new strategies: crossover operator and mutation strategy, into the standard ITo. In the iteration course of HITo, the dual-chromosome coding is used to code a feasible solution of MSCTSP, and the stochastic drift and volatility operators are used to explore and exploit new unknown region. During the process, drift operator is performed by crossover operator, volatility operator is carried out by mutation strategy, and they are both affected by activity intensity of particles which functionally depends on the radius and temperature. Experiments display HITo shows an improvement over comparative algorithms on solution quality.

学科与关键词

关键词
ITo algorithmmaximum scatter colored traveling salesman problemdrift operatorvolatility operatorcrossover operatormutation strategy
相关
加载中…
  • Hybrid ITO Algorithm for Large-Scale Colored Traveling Salesman Problem
    Dong, Xueshi*CHINESE JOURNAL OF ELECTRONICS, 2024, 33(6): 1337-1345.
  • 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
  • ITO algorithm with local search for large scale multiple balanced traveling salesmen problem
    Dong, Xueshi*; Xu, Min; Lin, Qing*; Han, Shuning; Li, Qingshun; Guo, QingtengKnowledge-Based Systems, 2021, 229: 107330.被引 15
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTER JOURNAL
发表日期
2024-01-14
DOI
10.1093/comjnl/bxad131
语言
ENGLISH
成果收录
SCIE
资助标注
Shandong Provincial Natural Science Foundation of China [ZR2023MF092]; Foundation of State Key Laboratory of Public Big Data [PBD2023-14]; Beijing Key Laboratory of Urban Spatial Information Engineering [20220109]; Basic Science (Natural Science) Research Project of Colleges and Universities in Jiangsu Province [22KJA520004]; National Natural Science Foundation of China [12371491, 61902189]; Shandong Provincial Key Laboratory of Software Engineering (Shandong University)

作者

  • D

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

    guizhou univ · qingdao univ

  • L

    Lin, Qing

    qingdao univ

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

    Wang, Wei

    qingdao univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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