Key points are not available for this paper at this time.
This study presents a post-disaster delivery problem called the relief distribution problem using drones under uncertainty, in which critical relief items are distributed to disaster victims gathered at assembly points after a disaster, particularly an earthquake. Because roads may be obstructed by debris after an earthquake, drones can be used as the primary transportation mode. As the impact of an earthquake cannot be easily predicted, the demand and road network uncertainties are considered. Additionally, the objective is to minimize the total unsatisfied demand subject to a time-bound constraint on the deliveries, as well as the range and capacity limitations of drones. A two-stage stochastic programming and its deterministic equivalent problem formulations are presented. The scenario decomposition algorithm is implemented as an exact solution approach. To apply this study to real-life applications, a case study is conducted based on the western (European) side of Istanbul, Turkey. The computational results are used to evaluate the performance of the scenario decomposition algorithm and analyze the value of stochasticity and the expected value of perfect information under different parametric settings. We additionally conduct sensitivity analyses by varying the key parameters of the problem, such as the time-bound and capacities of the drones.
Dükkancı et al. (Fri,) studied this question.