|
Optimizing Hub-And-Spoke Networks Under Demand Uncertainty: A Stochastic Capacitated Single Allocation P-Hub Covering Model with Lagrangian Relaxation
|
Yaser Khosravian   , Ali Shahandeh Nookabadi , Ghasem Moslehi |
| , y.khosravian@in.iut.ac.ir |
|
|
Abstract: (205 Views) |
Traditional maximal p-hub covering problems focus on scenarios where network flow is constrained by resource limitations. However, many existing models rely on static parameters, overlooking the inherent randomness present in real-world logistics. This oversight can result in suboptimal network designs that are vulnerable to congestion and rising costs as demand varies. To address this issue, we propose a novel mathematical model for the capacitated single allocation maximal p-hub covering problem that takes into account stochastic variations in origin-destination flows. Although solving this model poses computational challenges, we utilize a Lagrangian relaxation algorithm to enhance efficiency. Computational experiments using the CAB dataset highlight the effectiveness of our approach in achieving optimal solutions while reducing computation time. This framework offers valuable insights for designing robust hub-and-spoke networks in the face of demand uncertainty.
|
|
| Keywords: Maximal hub covering, Demand uncertainty, Lagrangian Relaxation Method, Capacitated hubs |
|
|
Full-Text [PDF 310 kb]
(199 Downloads)
|
Type of Study: Original |
Subject:
Mathematical Modeling and Applications of OR
Received: 2024/06/9 | Accepted: 2024/08/21 | Published: 2024/09/2
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
