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

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 RESEARCH2022-7DOI: 10.1016/j.cor.2022.105772
16被引3阅读
引用收藏
分享

摘要

The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard Traveling Salesmen Problem (TSP), that there are m (m > 1) salesmen to visit the cities. In this paper, we address the mTSP with both the minsum objective and minmax objective, which aims at minimizing the total length of the m tours and the length of the longest tour among all the m tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for the mTSP. Each iteration of ITSHA consists of an initialization stage and an improvement stage. The initialization stage aims to generate high-quality and diverse initial solutions. The improvement stage mainly applies the variable neighborhood search (VNS) approach based on our proposed effective local search neighborhoods to optimize the initial solution. Moreover, some local optima escaping approaches are employed to enhance the search ability of the algorithm. Extensive experimental results on a wide range of public benchmark instances show that ITSHA significantly outperforms the state-of-the-art heuristic algorithms in solving the mTSP on both the objectives.

学科与关键词

关键词
Multiple Traveling Salesmen ProblemCombinatorial optimizationVariable neighborhood searchHeuristicLocal search
相关
加载中…
  • Hybrid search with neighborhood reduction for the multiple traveling salesman problem
    He, Pengfei; Hao, Jin-Kao*COMPUTERS & OPERATIONS RESEARCH, 2022, 142: 105726.被引 17
  • Iterated two-phase local search for the colored traveling salesmen problem
    He, Pengfei; Hao, Jin-Kao*ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 97: 104018.被引 14
  • A comparative study of improved GA and PSO in solving multiple traveling salesmen problem
    Zhou, Honglu; Song, Mingli*; Pedrycz, WitoldAPPLIED SOFT COMPUTING, 2018, 64: 564-580.被引 107
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2022-07
卷期
第 143 卷
页码
105772
DOI
10.1016/j.cor.2022.105772
语言
ENGLISH
成果收录
SCIE

作者

  • Z

    Zheng, Jiongzhi (第一作者)

    huazhong univ sci & technol

  • H

    Hong, Yawei

    huazhong univ sci & technol

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

    Xu, Wenchang

    huazhong univ sci & technol

  • L

    Li, Wentao

    huazhong univ sci & technol

  • C

    Chen, Yongfu (通讯)

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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