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

Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach

Xu, Xiangping; Li, Jun*; Zhou, Mengchu; Yu, Xinghuosoutheast univ
IEEE Transactions on Cybernetics2022-9DOI: 10.1109/TCYB.2021.3070143
17被引2阅读
引用收藏
分享

摘要

A traveling salesman problem (CTSP) as a generalization of the well-known multiple traveling salesman problem utilizes colors to distinguish the accessibility of individual cities to salesmen. This work formulates a precedence-constrained CTSP (PCTSP) over hypergraphs with asymmetric city distances. It is capable of modeling the problems with operations or activities constrained to precedence relationships in many applications. Two types of precedence constraints are taken into account, i.e., 1) among individual cities and 2) among city clusters. An augmented variable neighborhood search (VNS) called POPMUSIC-based VNS (PVNS) is proposed as a main framework for solving PCTSP. It harnesses a partial optimization metaheuristic under special intensification conditions to prepare candidate sets. Moreover, a topological sort-based greedy algorithm is developed to obtain a feasible solution at the initialization phase. Next, mutation and multi-insertion of constraint-preserving exchanges are combined to produce different neighborhoods of the current solution. Two kinds of constraint-preserving k-exchange are adopted to serve as a strong local search means. Extensive experiments are conducted on 34 cases. For the sake of comparison, Lin-Kernighan heuristic, two genetic algorithms and three VNS methods are adapted to PCTSP and fine-tuned by using an automatic algorithm configurator-irace package. The experimental results show that PVNS outperforms them in terms of both search ability and convergence rate. In addition, the study of four PVNS variants each lacking an important operator reveals that all operators play significant roles in PVNS.

学科与关键词

关键词
Urban areasColorOptimizationTraveling salesman problemsTask analysisMeasurementSystematicstraveling salesman problem (CTSP)constrained optimizationhypergraphpartial optimization metaheuristic under special intensification conditions (POPMUSIC)machine learningprecedence constraintvariable neighborhood search (VNS)
相关
加载中…
  • 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
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Cybernetics
发表日期
2022-09
卷期
第 52 卷, 第 9 期
页码
9797-9808
DOI
10.1109/TCYB.2021.3070143
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61773115]; Jiangsu Province Natural Science Foundation [BK20161427]; Shenzhen Fundamental Research Program [JCYJ20190813152401690]; Australian Research Council [DP200101197]; Australian Research Council [DP200101197] Funding Source: Australian Research Council

作者

  • X

    Xu, Xiangping (第一作者)

    southeast univ

  • L

    Li, Jun (通讯)

    southeast univ

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

    Zhou, Mengchu

  • Y

    Yu, Xinghuo

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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