二方旅行推销员问题：金字塔式可解案例

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2024-05-27 DOI:10.1016/j.orl.2024.107130

Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger

{"title":"二方旅行推销员问题：金字塔式可解案例","authors":"Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger","doi":"10.1016/j.orl.2024.107130","DOIUrl":null,"url":null,"abstract":"<div>Given k blue cities, k red cities and a <math><mn>2</mn><mi>k</mi><mo>×</mo><mn>2</mn><mi>k</mi></math> distance matrix, the task in the bipartite travelling salesman problem is to find a shortest tour which alternately visits blue and red cities. We consider the special case of Van der Veen distance matrices and show that it remains NP-hard in general but can be solved in <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> time when all vertices with odd indices are blue and all with even indices are red.</div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107130"},"PeriodicalIF":0.8000,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016763772400066X/pdfft?md5=c5ebab7f8ed20ec28056efd78f98f6f7&pid=1-s2.0-S016763772400066X-main.pdf","citationCount":"0","resultStr":"{\"title\":\"The bipartite travelling salesman problem: A pyramidally solvable case\",\"authors\":\"Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger\",\"doi\":\"10.1016/j.orl.2024.107130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>Given k blue cities, k red cities and a <math><mn>2</mn><mi>k</mi><mo>×</mo><mn>2</mn><mi>k</mi></math> distance matrix, the task in the bipartite travelling salesman problem is to find a shortest tour which alternately visits blue and red cities. We consider the special case of Van der Veen distance matrices and show that it remains NP-hard in general but can be solved in <math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> time when all vertices with odd indices are blue and all with even indices are red.</div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"55 \",\"pages\":\"Article 107130\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S016763772400066X/pdfft?md5=c5ebab7f8ed20ec28056efd78f98f6f7&pid=1-s2.0-S016763772400066X-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S016763772400066X\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S016763772400066X","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

给定 k 个蓝色城市、k 个红色城市和一个 2k×2k 的距离矩阵，两方旅行推销员问题的任务是找到一个交替访问蓝色和红色城市的最短旅行路线。我们考虑了范德维恩距离矩阵的特殊情况，并证明该问题在一般情况下仍然是 NP 难题，但当所有奇数索引的顶点都是蓝色，偶数索引的顶点都是红色时，该问题可以在 O(k2) 时间内求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The bipartite travelling salesman problem: A pyramidally solvable case

Given k blue cities, k red cities and a $2 k \times 2 k$ distance matrix, the task in the bipartite travelling salesman problem is to find a shortest tour which alternately visits blue and red cities. We consider the special case of Van der Veen distance matrices and show that it remains NP-hard in general but can be solved in $O (k^{2})$ time when all vertices with odd indices are blue and all with even indices are red.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.