TY - JOUR

T1 - Multi-period hub network design from a dual perspective

T2 - An integrated approach considering congestion, demand uncertainty, and service quality optimization

AU - Bayram, Vedat

AU - Aydoğan, Çiya

AU - Kargar, Kamyar

PY - 2025/4/5

Y1 - 2025/4/5

N2 - 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.

AB - 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.

U2 - 10.1016/j.ejor.2025.04.011

DO - 10.1016/j.ejor.2025.04.011

M3 - Journal article

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

ER -