A Cloud Container-Based Distributed Solving Approach to Superscale Colored Traveling Salesman Problems

Zhicheng Lin, Jun Li, Yongcui Li
{"title":"A Cloud Container-Based Distributed Solving Approach to Superscale Colored Traveling Salesman Problems","authors":"Zhicheng Lin, Jun Li, Yongcui Li","doi":"10.21203/rs.3.rs-3603107/v1","DOIUrl":null,"url":null,"abstract":"Abstract The colored traveling salesman problem (CTSP) generalizes the well-known multiple traveling salesman problem (MTSP) by utilizing colors to describe the accessibility of cities to individual salesmen. Many serial algorithms have been developed to solve CTSP instances. This work presents a distributed solving method for CTSP for the first time. First, a cloud container-based distributed solving framework for CTSP is designed and implemented in a pipeline style. A superscale CTSP can be decomposed into many TSPs to solve in parallel to reduce computational complexity dramatically. Second, following the framework, we develop a distributed Delaunay-triangulation-based variable neighborhood search (DDVNS) algorithm. In DDVNS, a two-stage initialization is exploited to generate each TSP solution. Then, Delaunay-triangulation-based variable neighborhood search (DVNS) is applied to search for the local TSP optima within a neighborhood delicately. In addition, the solutions are improved further by reallocating the multicolor cities and repeating the search progress. Finally, the extensive experiments show that DDVNS outperforms the state-of-the-art serial algorithms regarding search efficiency and solution quality. Notably, We can achieve a satisfactory solution in a superscale case of 16 salesmen and 160000 cities within 15 minutes, which breaks the existing solving record of CTSPs.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research Square (Research Square)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21203/rs.3.rs-3603107/v1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract The colored traveling salesman problem (CTSP) generalizes the well-known multiple traveling salesman problem (MTSP) by utilizing colors to describe the accessibility of cities to individual salesmen. Many serial algorithms have been developed to solve CTSP instances. This work presents a distributed solving method for CTSP for the first time. First, a cloud container-based distributed solving framework for CTSP is designed and implemented in a pipeline style. A superscale CTSP can be decomposed into many TSPs to solve in parallel to reduce computational complexity dramatically. Second, following the framework, we develop a distributed Delaunay-triangulation-based variable neighborhood search (DDVNS) algorithm. In DDVNS, a two-stage initialization is exploited to generate each TSP solution. Then, Delaunay-triangulation-based variable neighborhood search (DVNS) is applied to search for the local TSP optima within a neighborhood delicately. In addition, the solutions are improved further by reallocating the multicolor cities and repeating the search progress. Finally, the extensive experiments show that DDVNS outperforms the state-of-the-art serial algorithms regarding search efficiency and solution quality. Notably, We can achieve a satisfactory solution in a superscale case of 16 salesmen and 160000 cities within 15 minutes, which breaks the existing solving record of CTSPs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于云容器的超大规模有色旅行商问题分布式求解方法
彩色旅行商问题(CTSP)是对著名的多重旅行商问题(MTSP)的推广,利用颜色来描述城市对单个推销员的可达性。为了求解CTSP实例,已经开发了许多串行算法。本文首次提出了CTSP的分布式求解方法。首先,以管道方式设计并实现了基于云容器的CTSP分布式求解框架。超大尺度CTSP可以分解成多个tsp并行求解,大大降低了计算复杂度。其次,根据该框架,我们开发了一种基于分布式delaunay三角剖分的变量邻域搜索(DDVNS)算法。在DDVNS中,利用两阶段初始化来生成每个TSP解决方案。然后,采用基于delaunay三角剖分的变量邻域搜索(DVNS),在邻域内精细搜索局部TSP最优。此外,通过重新分配多色城市和重复搜索过程,进一步改进了解决方案。最后,大量的实验表明,DDVNS在搜索效率和解质量方面优于最先进的串行算法。值得注意的是,我们可以在15分钟内完成16个销售人员,16万个城市的超大规模案例的满意解决,打破了现有ctsp的解决记录。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Event Reduction in Localization of DES Supervisory Control Semantic Relational Extraction via Learning Syntactic Structural Representation Vehicle Tracking System using Sensor Fusion with Signal Loss Compensation Automotive Tracking System with Signal Lost Compensation Bridging the Gap: Assessing the Integration of Artificial Intelligence in Healthcare for Improved Efficiency and Doctor Adaptability.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1