A robust stochastic Casualty Collection Points location problem

In this paper, a Casualty Collection Points (CCPs) location problem is formulated as a two-stage robust stochastic optimization model in an uncertain environment. In this modelling approach, the network design decisions are integrated with the multi-period response operational decisions where the number of casualties with different levels of injuries coming from the affected areas is uncertain. Furthermore, the transportation capacity for the evacuation of casualties to CCPs and hospitals is also uncertain. To solve this complex problem, a robust sample average approximation method with the feasibility restoration technique is proposed, and its efficiency is examined through a statistical validation procedure. We then evaluate the proposed methodology in the backdrop of a hypothetical case of Bhopal gas tragedy (with the same hazard propagation profile) at the present day. We also report the solution robustness and model robustness of 144 instances of the case-study to show the proficiency of our proposed solution approach. Results analysis reveals that our modelling approach enables the decision makers to design a humanitarian logistic network in which not only the proximity and accessibility to CCPs are improved, but also the number of lives lost is decreased. Moreover, it is shown that the proposed robust stochastic optimization approach converges rapidly and more efficiently. We hope that our methodology will encourage urban city planners to pre-identify CCP locations, and, in the event of a disaster, help them decide on the subset of these CCPs that could be rapidly mobilised for disaster response.