Search results

This study aims to minimize the expected arrival time of relief vehicles to the affected areas, considering the destruction of potential routes and disruptions due to disasters. In relief operations, required relief items in each affected area and disrupted routes are considered as uncertain parameters. Additionally, for a more realistic consideration of the situations, it is assumed that the demand of each affected area could be met by multiple vehicles and distribution centers (DCs) and vehicles have limited capacity.

The current study developed a two-stage stochastic programming model for the distribution of relief items from DCs to the affected areas. Locating the DCs was the first-stage decisions in the introduced model. The second-stage decisions consisted of routing and scheduling of the vehicles to reach the affected areas.

In this paper, 7th district of Tehran was selected as a case study to assess the applicability of the model, and related results and different sensitivity analyses were presented as well. By carrying out a simultaneous sensitivity analysis on the capacity of vehicles and the maximum number of DCs that can be opened, optimal values for these parameters were determined, that would help making optimal decisions upon the occurrence of a disaster to decrease total relief time and to maximize the exploitation of available facilities.

The contributions of this paper are as below: presenting an integrated model for the distribution of relief items among affected areas in the response phase of a disaster, using a two-stage stochastic programming approach to cope with route disruptions and uncertain demands for relief items, determining location of the DCs and routing and scheduling of vehicles to relief operations and considering a heterogeneous fleet of capacitated relief vehicles and DCs with limited capacity and fulfilling the demand of each affected area by more than one vehicle to represent more realistic situations.

A growing body of evidence points to the influence of location and allocation decisions on the structure of healthcare networks. The authors introduced a three-level hierarchical facility location model to minimize travel time in the healthcare system under uncertainty.

Most healthcare networks are hierarchical and, as a result, the linkage between their levels makes it difficult to specify the location of the facilities. In this article, the authors present a hybrid approach according to data envelopment analysis and robust programming to design a healthcare network. In the first phase, the efficiency of each potential location is calculated based on the non-radial range-adjusted measure considering desirable and undesirable outputs based on a number of criteria such as the target area's population, proximity to earthquake faults, quality of urban life, urban decrepitude, etc. The locations deemed suitable are then used as candidate locations in the mathematical model. In the second phase, based on the proposed robust optimization model, called light robustness, the location and allocation decisions are adopted.

The developed model is evaluated using an actual-world case study in District 1 of Tehran, Iran and relevant results and different sensitivity analyses were presented as well. When the percentage of referral parameters changes, the value of the robust model's objective function increases.

The contributions of this article are listed as follows: Considering desirable and undesirable criteria to selecting candidate locations, providing a robust programming model for building a service network and applying the developed model to an actual-world case study.