关于枢纽位置-路线模型及其解决技术的文献综述

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-10-10 DOI:10.1016/j.cor.2024.106861
Sebastian Wandelt, Shuang Wang, Xiaoqian Sun
{"title":"关于枢纽位置-路线模型及其解决技术的文献综述","authors":"Sebastian Wandelt,&nbsp;Shuang Wang,&nbsp;Xiaoqian Sun","doi":"10.1016/j.cor.2024.106861","DOIUrl":null,"url":null,"abstract":"<div><div>Hub location problems (HLPs), which essentially aim at optimizing the location of hubs and the allocation of spokes to satisfy a given demand, have been studied over nearly four decades. Since dedicated allocation connections between each spoke and its hub may increase the operating cost and underutilize the vehicle capacity, especially in less-than-truckload freight service applications, the last ten years have witnessed an increasing interest of researchers in hub location routing problems (HLRPs). HLRPs involve a more comprehensive approach, by considering both facility location and vehicle routing aspects simultaneously, also optimizing the assignment of customers to these hubs and finding the best routes from hubs to customers, making HLRPs more complex and practical for real-world logistics and distribution scenarios than HLPs. In this paper, we review the HLRP models proposed in the existing literature, the commonalities and differences of developed solutions techniques, particularly concerning the computation of incumbent solutions and neighborhood changes. We believe that our study contributes to the existing literature, by unifying the rather scattered publication landscape on HLRPs and proposing a set of interesting directions for future work.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106861"},"PeriodicalIF":4.1000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A literature review on hub location-routing models and their solution techniques\",\"authors\":\"Sebastian Wandelt,&nbsp;Shuang Wang,&nbsp;Xiaoqian Sun\",\"doi\":\"10.1016/j.cor.2024.106861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Hub location problems (HLPs), which essentially aim at optimizing the location of hubs and the allocation of spokes to satisfy a given demand, have been studied over nearly four decades. Since dedicated allocation connections between each spoke and its hub may increase the operating cost and underutilize the vehicle capacity, especially in less-than-truckload freight service applications, the last ten years have witnessed an increasing interest of researchers in hub location routing problems (HLRPs). HLRPs involve a more comprehensive approach, by considering both facility location and vehicle routing aspects simultaneously, also optimizing the assignment of customers to these hubs and finding the best routes from hubs to customers, making HLRPs more complex and practical for real-world logistics and distribution scenarios than HLPs. In this paper, we review the HLRP models proposed in the existing literature, the commonalities and differences of developed solutions techniques, particularly concerning the computation of incumbent solutions and neighborhood changes. We believe that our study contributes to the existing literature, by unifying the rather scattered publication landscape on HLRPs and proposing a set of interesting directions for future work.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"173 \",\"pages\":\"Article 106861\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824003332\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003332","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

枢纽位置问题(HLPs)的主要目的是优化枢纽的位置和辐条的分配,以满足给定的需求,该问题已被研究了近四十年。由于每条辐条与其枢纽之间的专用分配连接可能会增加运营成本,并且无法充分利用车辆容量,尤其是在零担货运服务应用中,因此在过去十年中,研究人员对枢纽位置路由问题(HLRP)的兴趣与日俱增。HLRP 涉及一种更全面的方法,它同时考虑了设施位置和车辆路由方面,还优化了客户到这些枢纽的分配,并找到了从枢纽到客户的最佳路线,这使得 HLRP 比 HLP 更复杂,在现实世界的物流配送场景中更实用。在本文中,我们回顾了现有文献中提出的 HLRP 模型、已开发解决方案技术的共性和差异,尤其是关于现任解决方案和邻域变化的计算。我们相信,我们的研究将统一有关 HLRP 的相当分散的出版物,并为未来工作提出一系列有趣的方向,从而为现有文献做出贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A literature review on hub location-routing models and their solution techniques
Hub location problems (HLPs), which essentially aim at optimizing the location of hubs and the allocation of spokes to satisfy a given demand, have been studied over nearly four decades. Since dedicated allocation connections between each spoke and its hub may increase the operating cost and underutilize the vehicle capacity, especially in less-than-truckload freight service applications, the last ten years have witnessed an increasing interest of researchers in hub location routing problems (HLRPs). HLRPs involve a more comprehensive approach, by considering both facility location and vehicle routing aspects simultaneously, also optimizing the assignment of customers to these hubs and finding the best routes from hubs to customers, making HLRPs more complex and practical for real-world logistics and distribution scenarios than HLPs. In this paper, we review the HLRP models proposed in the existing literature, the commonalities and differences of developed solutions techniques, particularly concerning the computation of incumbent solutions and neighborhood changes. We believe that our study contributes to the existing literature, by unifying the rather scattered publication landscape on HLRPs and proposing a set of interesting directions for future work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Editorial Board A literature review of reinforcement learning methods applied to job-shop scheduling problems An accelerated Benders decomposition method for distributionally robust sustainable medical waste location and transportation problem Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria Portfolio optimisation: Bridging the gap between theory and practice
×
引用
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