Article ID: | iaor20164283 |
Volume: | 50 |
Issue: | 3 |
Start Page Number: | 1092 |
End Page Number: | 1113 |
Publication Date: | Aug 2016 |
Journal: | Transportation Science |
Authors: | Noyan Nilay, Balcik Burcu, Atakan Semih |
Keywords: | stochastic processes, combinatorial optimization, networks, design, simulation, heuristics |
In this study, we introduce a distribution network design problem that determines the locations and capacities of the relief distribution points in the last mile network, while considering demand‐ and network‐related uncertainties in the post‐disaster environment. The problem addresses the critical concerns of relief organizations in designing last mile networks, which are providing accessible and equitable service to beneficiaries. We focus on two types of supply allocation policies and propose a hybrid version considering their different implications on equity and accessibility. Then, we develop a two‐stage stochastic programming model that incorporates the hybrid allocation policy and achieves high levels of accessibility and equity simultaneously. We devise a branch‐and‐cut algorithm based on Benders decomposition to solve large problem instances in reasonable times and conduct a numerical study to demonstrate the computational effectiveness of the solution method. We also illustrate the application of our model on a case study based on real‐world data from the 2011 Van earthquake in Turkey.