Two-stage robust multimodal hub network design under budgeted demand uncertainty: A Benders decomposition approach and a case study

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-11-04 DOI:10.1016/j.cor.2024.106882
Haifeng Zhang , Kai Yang , Jianjun Dong , Lixing Yang
{"title":"Two-stage robust multimodal hub network design under budgeted demand uncertainty: A Benders decomposition approach and a case study","authors":"Haifeng Zhang ,&nbsp;Kai Yang ,&nbsp;Jianjun Dong ,&nbsp;Lixing Yang","doi":"10.1016/j.cor.2024.106882","DOIUrl":null,"url":null,"abstract":"<div><div>The widening use of hub networks in urban agglomeration freight systems requires several actual extensions in conventional hub network design problems. For this purpose, we introduce a two-stage robust multimodal hub network design problem for the urban agglomeration freight system by considering incomplete hub network topology, multiple transportation modes, travel time limit and discuss the uncertainty in the constructed network from the demand point of view. Particularly, we model the demand uncertainty for the considered problem in two different ways. The basic model supposes that interval-budgeted uncertainty set is adopted to characterize uncertain demand, while the expanded model additionally considers possible states of the uncertain demand and weights summation of performances over multiple uncertainty sets, namely state-wise budgeted uncertainty set. By using a min–max criterion, we develop the path-based mixed-integer programming formulations for the proposed problem, which can significantly decrease the number of required integer variables and constraints. To handle large-sized problems, we propose an improved Benders decomposition algorithm, in which the master problem is implemented in a branch-and-bound framework and the subproblem is optimality solved by a customized two-step strategy. In addition to evaluating on the standard CAB, TR and AP datasets, we conduct a real-world case study of the Beijing–Tianjin–Hebei urban agglomeration freight system to explore the effect of incorporating uncertainty and showcase the superior performance of the proposed methods.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106882"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-04","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/S030505482400354X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The widening use of hub networks in urban agglomeration freight systems requires several actual extensions in conventional hub network design problems. For this purpose, we introduce a two-stage robust multimodal hub network design problem for the urban agglomeration freight system by considering incomplete hub network topology, multiple transportation modes, travel time limit and discuss the uncertainty in the constructed network from the demand point of view. Particularly, we model the demand uncertainty for the considered problem in two different ways. The basic model supposes that interval-budgeted uncertainty set is adopted to characterize uncertain demand, while the expanded model additionally considers possible states of the uncertain demand and weights summation of performances over multiple uncertainty sets, namely state-wise budgeted uncertainty set. By using a min–max criterion, we develop the path-based mixed-integer programming formulations for the proposed problem, which can significantly decrease the number of required integer variables and constraints. To handle large-sized problems, we propose an improved Benders decomposition algorithm, in which the master problem is implemented in a branch-and-bound framework and the subproblem is optimality solved by a customized two-step strategy. In addition to evaluating on the standard CAB, TR and AP datasets, we conduct a real-world case study of the Beijing–Tianjin–Hebei urban agglomeration freight system to explore the effect of incorporating uncertainty and showcase the superior performance of the proposed methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
预算需求不确定情况下的两阶段稳健多式联运枢纽网络设计:本德斯分解法和案例研究
随着枢纽网络在城市群货运系统中的应用越来越广泛,需要对传统的枢纽网络设计问题进行一些实际扩展。为此,我们通过考虑不完整的枢纽网络拓扑结构、多种运输方式、旅行时间限制等因素,引入了城市集群货运系统的两阶段鲁棒多式联运枢纽网络设计问题,并从需求角度讨论了所构建网络的不确定性。特别是,我们用两种不同的方法为所考虑问题的需求不确定性建模。基本模型假定采用区间预算不确定性集来描述不确定需求,而扩展模型则额外考虑了不确定需求的可能状态,并对多个不确定性集的性能进行加权求和,即状态预算不确定性集。通过使用最小-最大准则,我们为所提问题开发了基于路径的混合整数编程公式,从而大大减少了所需整数变量和约束条件的数量。为了处理大型问题,我们提出了一种改进的 Benders 分解算法,其中主问题在分支与边界框架中实现,子问题通过定制的两步策略优化求解。除了在标准 CAB、TR 和 AP 数据集上进行评估外,我们还对京津冀城市群货运系统进行了实际案例研究,以探索纳入不确定性的影响,并展示所提方法的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Understand your decision rather than your model prescription: Towards explainable deep learning approaches for commodity procurement Airline recovery problem under disruptions: A review A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations Scheduling AMSs with generalized Petri nets and highly informed heuristic search Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
×
引用
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