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

ITO algorithm with local search for large scale multiple balanced traveling salesmen problem

Dong, Xueshi*; Xu, Min; Lin, Qing*; Han, Shuning; Li, Qingshun; Guo, Qingteng青岛大学; 武汉大学
Knowledge-Based Systems2021-10-11DOI: 10.1016/j.knosys.2021.107330
15被引2阅读
引用收藏
分享

摘要

In the fields such as computer science, intelligent transport systems and logistics scheduling, many problems can be reflected as the variants of traveling salesman problem (TSP). In recent years, although there are many achievements and developments on the study of intelligent optimization algorithms for TSP and its variants, the challenge and problem are still existed: while the scale of problem is large, there is the dimension disaster problem; the optimization algorithms for TSP variants are easy to fall into the local optimum. Multiple balanced traveling salesmen problem (MBTSP) is a variant of TSP, it can be used in the fields such as optimizing multiple gas turbine engines. Since MBTSP is NP-hard problem, many intelligent optimization algorithms, such as genetic algorithm and ITO algorithm, have been used to solve it. However, while the scale of MBTSP is large, the traditional algorithms are easy to fall into local optimum. Aiming at the problem, this paper extends the scale of MBTSP to large scale scenes, and proposes a novel ITO algorithm (NITO) based on crossover operator and local search for large scale MBTSP. For NITO algorithm, the drift operator and volatility operator of ITO algorithm are redesigned, which are carried out by improved crossover operator and local search. The extensive experiments show that NITO can demonstrate better solution quality than the compared state-of-the-art algorithms.

学科与关键词

关键词
ITO algorithmLarge scale optimizationMultiple balanced traveling salesmen problemCrossover operatorLocal search
相关
加载中…
  • Hybrid ITO Algorithm for Large-Scale Colored Traveling Salesman Problem
    Dong, Xueshi*CHINESE JOURNAL OF ELECTRONICS, 2024, 33(6): 1337-1345.
  • An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
    Zheng, Jiongzhi; Hong, Yawei; Xu, Wenchang; Li, Wentao; Chen, Yongfu*COMPUTERS & OPERATIONS RESEARCH, 2022, 143: 105772.被引 16
  • Hybrid IT? Algorithm for Maximum Scatter Colored Traveling Salesman Problem
    Dong, Xueshi*; Lin, Qing; Wang, WeiCOMPUTER JOURNAL, 2024.被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
Knowledge-Based Systems
发表日期
2021-10-11
卷期
第 229 卷
页码
107330
DOI
10.1016/j.knosys.2021.107330
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE
资助标注
National Key Research and Development Plan Key Special Projects, China [2018YFB2100303]; Shandong Provincial Key Laboratory of Software Engineering (Shandong University), China [2020SP-KLSE0612]; Beijing Key Laboratory of Urban Spatial Information Engineering [20210220]

作者

  • D

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

    wuhan univ · qingdao univ

  • X

    Xu, Min

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

    Lin, Qing (通讯)

    qingdao univ

  • H

    Han, Shuning

    qingdao univ

  • L

    Li, Qingshun

    qingdao univ

  • G

    Guo, Qingteng

    qingdao univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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