枢纽位置问题与紧化公式的比较：注释

IF 8.3 1区工程技术 Q1 ECONOMICS

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-12-16 DOI:10.1016/j.tre.2024.103902

Fran Setiawan, Tolga Bektaş, Çağatay Iris

{"title":"枢纽位置问题与紧化公式的比较：注释","authors":"Fran Setiawan, Tolga Bektaş, Çağatay Iris","doi":"10.1016/j.tre.2024.103902","DOIUrl":null,"url":null,"abstract":"Hub location is a planning problem that involves choosing, from a set of nodes, a subset to designate as hub facilities, linking the hubs to the remaining nodes using a hub-and-spoke structure, and routing of flows on the resulting network. This paper presents theoretical and computational comparisons of the fundamental compact formulations of the <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>p</mml:mi></mml:math>-hub location problem (<mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>p</mml:mi></mml:math>-HLP) for three allocation strategies, namely single, multiple and <mml:math altimg=\"si823.svg\" display=\"inline\"><mml:mi>r</mml:mi></mml:math>-allocation. Our theoretical results show that path-based formulations offer the strongest linear programming relaxation. The computational experiments, run on three prominent datasets using a state-of-the-art commercial solver indicate that, flow-based formulations generally solve the largest number of instances to optimality and require the shortest solution time, especially for large-scale instances.","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"88 1","pages":""},"PeriodicalIF":8.3000,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The hub location problem with comparisons of compact formulations: A note\",\"authors\":\"Fran Setiawan, Tolga Bektaş, Çağatay Iris\",\"doi\":\"10.1016/j.tre.2024.103902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hub location is a planning problem that involves choosing, from a set of nodes, a subset to designate as hub facilities, linking the hubs to the remaining nodes using a hub-and-spoke structure, and routing of flows on the resulting network. This paper presents theoretical and computational comparisons of the fundamental compact formulations of the <mml:math altimg=\\\"si1.svg\\\" display=\\\"inline\\\"><mml:mi>p</mml:mi></mml:math>-hub location problem (<mml:math altimg=\\\"si1.svg\\\" display=\\\"inline\\\"><mml:mi>p</mml:mi></mml:math>-HLP) for three allocation strategies, namely single, multiple and <mml:math altimg=\\\"si823.svg\\\" display=\\\"inline\\\"><mml:mi>r</mml:mi></mml:math>-allocation. Our theoretical results show that path-based formulations offer the strongest linear programming relaxation. The computational experiments, run on three prominent datasets using a state-of-the-art commercial solver indicate that, flow-based formulations generally solve the largest number of instances to optimality and require the shortest solution time, especially for large-scale instances.\",\"PeriodicalId\":49418,\"journal\":{\"name\":\"Transportation Research Part E-Logistics and Transportation Review\",\"volume\":\"88 1\",\"pages\":\"\"},\"PeriodicalIF\":8.3000,\"publicationDate\":\"2024-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part E-Logistics and Transportation Review\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1016/j.tre.2024.103902\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1016/j.tre.2024.103902","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}

引用次数: 0

摘要

集线器位置是一个规划问题，涉及从一组节点中选择一个子集来指定为集线器设施，使用轮辐结构将集线器连接到剩余的节点，以及在最终网络上路由流。本文对p-轮毂定位问题（p-HLP）的三种分配策略（单分配、多分配和多分配）的基本紧凑公式进行了理论和计算比较。我们的理论结果表明，基于路径的公式提供了最强的线性规划松弛。使用最先进的商业求解器在三个突出的数据集上运行的计算实验表明，基于流的公式通常可以解决最多数量的最优实例，并且需要最短的解决时间，特别是对于大规模实例。

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

查看原文本刊更多论文

The hub location problem with comparisons of compact formulations: A note

Hub location is a planning problem that involves choosing, from a set of nodes, a subset to designate as hub facilities, linking the hubs to the remaining nodes using a hub-and-spoke structure, and routing of flows on the resulting network. This paper presents theoretical and computational comparisons of the fundamental compact formulations of the p-hub location problem (p-HLP) for three allocation strategies, namely single, multiple and r-allocation. Our theoretical results show that path-based formulations offer the strongest linear programming relaxation. The computational experiments, run on three prominent datasets using a state-of-the-art commercial solver indicate that, flow-based formulations generally solve the largest number of instances to optimality and require the shortest solution time, especially for large-scale instances.

求助全文

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

来源期刊

Transportation Research Part E-Logistics and Transportation Review 工程技术-工程：土木

CiteScore

16.20

自引率

16.00%

发文量

285

审稿时长

62 days

期刊介绍： Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management. Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.