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

Bi-Objective Colored Traveling Salesman Problems

Xu, Xiangping; Li, Jun*; Zhou, MengChusoutheast univ
IEEE Transactions on Intelligent Transportation Systems2022-7DOI: 10.1109/TITS.2021.3086625
17被引5阅读
引用收藏
分享

摘要

As a generalization of the well-known multiple traveling salesman problem, a colored traveling salesman problem (CTSP) utilizes colors to describe the accessibility of individual cities to salesmen. To expand its application scope, this work presents a hi-objective CTSP (BCTSP) over hypergraphs, taking into account the balance of workload among salesmen. To solve it, a bi-objective variable neighborhood search (BVNS) is proposed as a solution framework. In BVNS, we exploit a two-stage initialization and a probability-based insertion to produce feasible solutions and generate their neighborhood. Next, population-based multi-insertion, color-preserving exchange and 2-opt constitute a powerful local search procedure, where color-preserving exchange improves the solutions by modifying the route intersections among distinct salesmen. Besides, Delaunay triangulation is utilized to prepare candidates for multi-insertion, thereby increasing the passibility to find an optimal route by shortening links among vertices. Extensive experiments are conducted on 20 cases. To make a comprehensive comparison, four existing methods, i.e., two genetic algorithms and two variable neighborhood search methods, are adapted by exploiting an elitist non-dominated sorting for solving BCTSP instances. The experimental results show that BVNS is superior to its peers in achieving Pareto optima in terms of three popular performance metrics, i.e., hypervolume, inverted generational distance, and C-metric. In addition, the study of four BVNS variants reveals that probability-based insertion, population-based multi-insertion, and color-preserving exchange play significant roles in BVNS's high performance.

学科与关键词

关键词
Colored traveling salesman problemlocal optimizationbi-objective optimizationvariable neighborhood search
相关
加载中…
  • Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach
    Xu, Xiangping; Li, Jun*; Zhou, Mengchu; Yu, XinghuoIEEE Transactions on Cybernetics, 2022, 52(9): 9797-9808.被引 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
  • 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 Engineering, 2024, 21(1): 895-905.被引 14
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Intelligent Transportation Systems
发表日期
2022-07
卷期
第 23 卷, 第 7 期
页码
6326-6336
DOI
10.1109/TITS.2021.3086625
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61773115]; Shenzhen Fundamental Research Program [JCYJ20190813152401690]

作者

  • X

    Xu, Xiangping (第一作者)

    southeast univ

  • L

    Li, Jun (通讯)

    southeast univ

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

    Zhou, MengChu

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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