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

Hybrid search with neighborhood reduction for the multiple traveling salesman problem

He, Pengfei; Hao, Jin-Kao*
COMPUTERS & OPERATIONS RESEARCH2022-6DOI: 10.1016/j.cor.2022.105726
17被引4阅读
引用收藏
分享

摘要

We present an effective hybrid algorithm with neighborhood reduction for solving the multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two objectives: to minimize the total traveling distance (the minsum mTSP) or to minimize the longest tour (the minmax mTSP). The proposed algorithm hybridizes inter-tour optimization with an efficient neighborhood search based on tabu search and intra-tour optimization using the traveling salesman heuristic EAX. A dedicated neighborhood reduction strategy is introduced to avoid the examination of non-promising candidate solutions and thus speed up the neighborhood search. Results of extensive computational experiments are shown on 41 popular instances from several sources and 36 new large instances. Comparisons with five state-of-the-art methods in the literature demonstrate a high competitiveness of the proposed algorithm. Additional experiments on applying a classical TSP heuristic to the minsum mTSP instances show excellent results.

学科与关键词

关键词
Traveling salesmanMultiple traveling salesmanHybrid heuristicNeighborhood reduction
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2022-06
卷期
第 142 卷
页码
105726
DOI
10.1016/j.cor.2022.105726
语言
ENGLISH
成果收录
SCIE
资助标注
China Scholarship Council (CSC) [201906850087]

作者

  • H

    He, Pengfei (第一作者)

  • H

    Hao, Jin-Kao (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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