双重视角下的多周期枢纽网络设计:考虑拥塞、需求不确定性和服务质量优化的综合方法

IF 6 2区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Vedat Bayram, Çiya Aydoğan, Kamyar Kargar
{"title":"双重视角下的多周期枢纽网络设计:考虑拥塞、需求不确定性和服务质量优化的综合方法","authors":"Vedat Bayram, Çiya Aydoğan, Kamyar Kargar","doi":"10.1016/j.ejor.2025.04.011","DOIUrl":null,"url":null,"abstract":"This study introduces a hub network design problem that considers three key factors: congestion, demand uncertainty, and multi-periodicity. Unlike classical models, which tend to address these factors separately, our model considers them simultaneously, providing a more realistic representation of hub network design challenges. Our model also incorporates service level considerations of network users, extending beyond the focus on transportation costs. Service quality is evaluated using two measures: travel time and the number of hubs visited during travel. Moreover, our model allows for adjustments in capacity levels and network structure throughout the planning horizon, adding a dynamic and realistic aspect to the problem setting. The inherent nonlinear nonconvex integer programming problem is reformulated into a mixed-integer second-order cone programming (SOCP) problem. To manage the model’s complexity, we propose an exact solution algorithm based on Benders decomposition, where the sub-problems are solved using a column generation technique. The efficacy of the solution approach is demonstrated through extensive computational experiments. Additionally, we discuss the benefits of each considered feature in terms of transportation costs and their impact on network structure, providing insights for the field.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"10 1","pages":""},"PeriodicalIF":6.0000,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-period hub network design from a dual perspective: An integrated approach considering congestion, demand uncertainty, and service quality optimization\",\"authors\":\"Vedat Bayram, Çiya Aydoğan, Kamyar Kargar\",\"doi\":\"10.1016/j.ejor.2025.04.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study introduces a hub network design problem that considers three key factors: congestion, demand uncertainty, and multi-periodicity. Unlike classical models, which tend to address these factors separately, our model considers them simultaneously, providing a more realistic representation of hub network design challenges. Our model also incorporates service level considerations of network users, extending beyond the focus on transportation costs. Service quality is evaluated using two measures: travel time and the number of hubs visited during travel. Moreover, our model allows for adjustments in capacity levels and network structure throughout the planning horizon, adding a dynamic and realistic aspect to the problem setting. The inherent nonlinear nonconvex integer programming problem is reformulated into a mixed-integer second-order cone programming (SOCP) problem. To manage the model’s complexity, we propose an exact solution algorithm based on Benders decomposition, where the sub-problems are solved using a column generation technique. The efficacy of the solution approach is demonstrated through extensive computational experiments. Additionally, we discuss the benefits of each considered feature in terms of transportation costs and their impact on network structure, providing insights for the field.\",\"PeriodicalId\":55161,\"journal\":{\"name\":\"European Journal of Operational Research\",\"volume\":\"10 1\",\"pages\":\"\"},\"PeriodicalIF\":6.0000,\"publicationDate\":\"2025-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1016/j.ejor.2025.04.011\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1016/j.ejor.2025.04.011","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

本研究提出一个枢纽网路设计问题,考虑三个关键因素:拥塞、需求不确定性和多周期性。与传统模型不同,传统模型倾向于单独处理这些因素,我们的模型同时考虑它们,为集线器网络设计挑战提供了更现实的表示。我们的模型还将网络用户的服务水平考虑在内,扩展到对运输成本的关注之外。服务质量是用两个指标来评估的:旅行时间和旅行期间访问的枢纽数量。此外,我们的模型允许在整个规划范围内调整容量水平和网络结构,为问题设置增加了动态和现实的方面。将固有的非线性非凸整数规划问题转化为混合整数二阶锥规划问题。为了管理模型的复杂性,我们提出了一种基于Benders分解的精确求解算法,其中子问题使用列生成技术求解。通过大量的计算实验证明了求解方法的有效性。此外,我们还从运输成本及其对网络结构的影响方面讨论了每个被考虑的功能的好处,为该领域提供了见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-period hub network design from a dual perspective: An integrated approach considering congestion, demand uncertainty, and service quality optimization
This study introduces a hub network design problem that considers three key factors: congestion, demand uncertainty, and multi-periodicity. Unlike classical models, which tend to address these factors separately, our model considers them simultaneously, providing a more realistic representation of hub network design challenges. Our model also incorporates service level considerations of network users, extending beyond the focus on transportation costs. Service quality is evaluated using two measures: travel time and the number of hubs visited during travel. Moreover, our model allows for adjustments in capacity levels and network structure throughout the planning horizon, adding a dynamic and realistic aspect to the problem setting. The inherent nonlinear nonconvex integer programming problem is reformulated into a mixed-integer second-order cone programming (SOCP) problem. To manage the model’s complexity, we propose an exact solution algorithm based on Benders decomposition, where the sub-problems are solved using a column generation technique. The efficacy of the solution approach is demonstrated through extensive computational experiments. Additionally, we discuss the benefits of each considered feature in terms of transportation costs and their impact on network structure, providing insights for the field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
European Journal of Operational Research
European Journal of Operational Research 管理科学-运筹学与管理科学
CiteScore
11.90
自引率
9.40%
发文量
786
审稿时长
8.2 months
期刊介绍: The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信