Multi-period hub network design from a dual perspective: An integrated approach considering congestion, demand uncertainty, and service quality optimization
IF 6 2区 管理学Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
{"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}
引用次数: 0
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.
期刊介绍:
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.