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

Memetic search for the minmax multiple traveling salesman problem with single and multiple depots

He, Pengfei; Hao, Jin-Kao*
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2023-6-16DOI: 10.1016/j.ejor.2022.11.010
22被引3阅读
引用收藏
分享

摘要

The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or multiple de-pots (the minmax multidepot mTSP) aims to minimize the longest tour among a set of tours. These two minmax problems are useful for a variety of real-life applications and typically studied separately in the literature. We propose a unified memetic approach to solving both cases of the minmax mTSP and the minmax multidepot mTSP. The proposed algorithm features a generalized edge assembly crossover to generate offspring solutions, an efficient variable neighborhood descent to ensure local optimization as well as an aggressive post-optimization for additional solution improvement. Extensive experimental re-sults on 77 minmax mTSP benchmark instances and 43 minmax multidepot mTSP instances commonly used in the literature indicate a high performance of the algorithm compared to the leading algorithms. Additional experimental investigations are conducted to shed light on the rationality of the key algorith-mic ingredients.

学科与关键词

关键词
Travelling salesmanCombinatorial optimizationHeuristicsMinmaxMultidepot
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2023-06-16
卷期
第 307 卷, 第 3 期
页码
1055-1070
DOI
10.1016/j.ejor.2022.11.010
语言
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