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

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

Zhou, Yangming; Xu, Wenqiang; Zhou, Mengchu; Fu, Zhang-Hua*华东理工大学; 上海交通大学
IEEE Transactions on Automation Science and Engineering2024-1DOI: 10.1109/TASE.2023.3236317
14被引2阅读
引用收藏
分享

摘要

A bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources for timely delivery of goods. In this work, we propose an efficient bi-trajectory hybrid search method for it. The proposed method integrates a route-based crossover operator to generate promising offspring solutions, a multi-neighborhood simulated annealing to perform local optimization, and a stagnation-detect-escape mechanism to help the search escape from local optima. We also propose a bidirectional adjacency solution representation method to encode a solution, which extends the traditional adjacency representation method by additionally employing an array to represent its reverse counterpart. Extensive evaluations on two sets of 58 widely used benchmark instances demonstrate that the proposed method significantly outperforms state-of-the-art algorithms. Investigations on key algorithm modules are performed to confirm the novelty and effectiveness of the proposed ideas and strategies. Finally, we verify the generalization of the proposed method via its use to solve a colored traveling salesman problem with its aim to balance workload among salesmen. Note to Practitioners-This work is motivated by the problems of scheduling transportation resources for timely delivery of goods. It proposes an effective bi-trajectory hybrid search to tackle bottleneck-minimized colored traveling salesman problem. The proposed approach performs bi-trajectory hybrid evolutionary search by maintaining only two individuals during the whole search process. Extensive numerical experiments and comparisons show that our proposed algorithm significantly outperforms state-of-the-art algorithms and can help decision-makers in designing best-routing solutions.

学科与关键词

关键词
Traveling salesman problembottleneckmetaheuristicevolutionary computationmemetic search
相关
加载中…
  • 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
  • Bi-Objective Colored Traveling Salesman Problems
    Xu, Xiangping; Li, Jun*; Zhou, MengChuIEEE Transactions on Intelligent Transportation Systems, 2022, 23(7): 6326-6336.被引 17
  • Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems
    Zhou, Yangming; Xu, Wenqiang; Fu, Zhang-Hua; Zhou, MengChu*IEEE Transactions on Intelligent Transportation Systems, 2022, 23(9): 16072-16082.被引 58
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Automation Science and Engineering
发表日期
2024-01
卷期
第 21 卷, 第 1 期
页码
895-905
DOI
10.1109/TASE.2023.3236317
语言
ENGLISH
成果收录
SCIE
资助标注
Shenzhen Science and Technology Innovation Commission [JCYJ20180508162601910]; National Natural Science Foundation of China [61903144]; Fundo para o Desenvolvimento das Ciencias e da Tecnologia (FDCT) [0047/2021/A1]; Open Project of the Shenzhen Institute of Artificial Intelligence and Robotics for Society [AC01202005002]

作者

  • Z

    Zhou, Yangming (第一作者)

    shanghai jiao tong univ

  • X

    Xu, Wenqiang

    east china univ sci & technol

查看全部 4 位作者收起作者
  • Z

    Zhou, Mengchu

  • F

    Fu, Zhang-Hua (通讯)

    chinese univ hong kong

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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