Search

Nowadays, logistics is one of the most important tools in disaster relief operations. The logistic planning is essential and a key component in covering the initial needs in the immediate aftermath of any disaster. Planning is both necessary and practical, as it is generally possible to predict the types of disasters that should affect a given location and the needs that such disasters will be likely to cause. Transport planning, reception and distribution of emergency supplies, type and quantity of the resources, the way of procurement and storage of the supplies, the tools of the tracking and means transportation to the stricken area, the specialization of teams participating in the operation and plan of cooperation between these teams, are some vital life-saving coordination roles after natural disasters are connected directly to logistic planning. Turkey is located in one of the most active earthquake and volcanic regions which causes to many major earthquake-prone, in the world with a majority of the population living in these earthquake-prone areas. Earthquakes are one of the major disasters that require emergency logistic planning strategies due to their devastating effects, the large-scale natural disasters could cause major problem on commodities such as food, medicine etc. In this paper, a game theoretical model for emergency logistic planning is developed. To do this a cooperative game model is constructed from a flow problem which occurred after an earthquake in Istanbul. Several solution concepts for maximizing the transferred commodity are given. The paper ends with a conclusion and outlook to future studies. [ABSTRACT FROM AUTHOR]

A Rapid Needs Assessment process is carried out immediately after the onset of a disaster to investigate the disaster's impact on affected communities, usually through field visits. Reviewing practical humanitarian guidelines reveals that there is a great need for decision support for field visit planning in order to utilize resources more efficiently at the time of great need. Furthermore, in practice, there is a tendency to use simple methods, rather than advanced solution methodologies and software; this is due to the lack of available computational tools and resources on the ground, lack of experienced technical staff, and also the chaotic nature of the post-disaster environment. We present simple heuristic algorithms inspired by the general procedure explained in practical humanitarian guidelines for site selection and routing decisions of the assessment teams while planning and executing the field visits. By simple, we mean methods that can be implemented by practitioners in the field using primary resources such as a paper map of the area and accessible software (e.g., Microsoft Excel). We test the performance of proposed heuristic algorithms, within a simulation environment , which enables us to incorporate various uncertain aspects of the post-disaster environment in the field, ranging from travel time and community assessment time to accessibility of sites and availability of community groups. We assess the performance of proposed heuristics based on real-world data from the 2011 Van earthquake in Turkey. Our results show that selecting sites based on an approximate knowledge of community groups' existence leads to significantly better results than selecting sites randomly. In addition, updating initial routes while receiving more information also positively affects the performance of the field visit plan and leads to higher coverage of community groups than an alternative strategy where inaccessible sites and unavailable community groups are simply skipped and the initial plan is followed. Uncertainties in travel time and community assessment time adversely affect the community group coverage. In general, the performance of more sophisticated methods requiring more information deteriorates more than the performance of simple methods when the level of uncertainty increases. [ABSTRACT FROM AUTHOR]

Despite the fact that medical responses are crucial for saving precious lives during any humanitarian crisis (e.g., the COVID-19 pandemic), healthcare infrastructure in many communities are partially covered or are not covered yet. In order to strengthen the health system response to such crisis, especially in low- to middle-income communities, this paper extends a novel multi-objective model for designing a health service network under uncertainty which simultaneously considers efficiency, social responsibility, and network cost. For efficiency, a modified data envelopment analysis model is introduced and inserted into the proposed model to decrease the inefficiency of healthcare facilities belonging to the different tiers of the health system. For social responsibility, two measures of job creation and balanced development are incorporated into the extended model. This is not only considered to cope with the increased numbers of patients and disaster victims to healthcare facilities but also to deal with the challenge of the economy and the livelihoods of people during the crisis. Moreover, a novel mixed possibilistic-flexible robust programming (MPFRP) approach is developed to protect the considered network against uncertainty. To show the applicability of the extended model, a real-world case study is presented. The results reveal that contrary to fuzzy programming models, the MPFRP performs well in terms of social responsibility (72%), cost (8%), and efficiency (28%) and is able to make a trade-off between these three measures. In this study, the resilience level of the designed network is not addressed while disregarding any short-term stoppage owing to internal or external sources of disruption in designing may bring about a considerable loss. [ABSTRACT FROM AUTHOR]

In natural disasters, having a capable network of collecting and distributing crucial items such as blood is one of the major concerns. However, due to damage to the infrastructure after disasters, mobile blood collecting facilities (blood mobiles) are usually required. This paper aims to decide the locations of mobile facilities in each period for collecting donated blood, plan the blood distribution from the fixed and mobile facilities to the main blood centers, as well as from blood centers to the hospitals and field-hospitals, under uncertain conditions. To do so, a multi-period, bi-objective mixed-integer mathematical model is developed under a multiple-scenario, aiming to minimize the unsatisfied blood demand as well as the total cost of the network. In the proposed model, the blood group compatibility matrix, failure rate of the facilities, and patients' urgency levels are considered. An augmented ε-constraint method is applied to solve this bi-objective model. Due to the complex nature of the proposed blood supply chain model, the Lagrangian relaxation approach is used to solve the proposed model. An expected Istanbul earthquake is considered, and the blood supply planning through the Red Crescent's European branch is performed utilizing the proposed model to examine its validity. According to the numerical results, the mobile facilities' locations in each period under each scenario are determined, the unsatisfied demand in each hospital and field-hospital for each blood type are reported, and the tradeoff between the supply chain costs and unsatisfied demand are discussed in detail. Finally, to illustrate the robustness of the proposed model, a detailed sensitivity analysis is performed. According to the study results, opening new blood centers near the high-demand sub-districts for faster testing and supply, increasing the hospitals' capacities, and usage of drones and helicopters for blood distribution are suggested can be considered as managerial insights. [ABSTRACT FROM AUTHOR]

Disasters may cause significant damages and long-lasting failures in lifeline infrastructure networks (such as gas, power and water), which must be recovered quickly to resume providing essential services to the affected communities. While making repair plans, it is important to consider the interdependencies among network components to minimize recovery times. In this paper, we focus on post-disaster repair operations of multiple interdependent lifeline networks, which involve functional dependencies. We assume that each network component, whether damaged or not, becomes nonfunctional if it depends on another nonfunctional component, and it is recovered when all components that it depends on become functional. We introduce a post-disaster coordinated infrastructure repair routing problem, in which dedicated repair teams of each lifeline infrastructure travel through a road network to visit the sites with damaged network components. We present a mixed integer programming model that assigns repair teams to the sites and constructs routes for each team in order to minimize the sum of the recovery times for all network components. We develop a constructive heuristic and a simulated annealing algorithm to solve the proposed coordinated routing problem. We test the performance of the proposed solution algorithms on a set of instances that are developed based on two interdependent lifeline networks (e.g., power and gas). The computational results show that our heuristics can quickly find high-quality solutions. Our results also indicate that coordinating repair operations can significantly improve the overall recovery time of interdependent infrastructure networks. [ABSTRACT FROM AUTHOR]

Large-scale disasters typically result in a shortage of essential medical resources, and thus it is critical to optimize resource allocation to improve the quality of the relief operations. One important factor that has been largely neglected when optimizing the available medical resources is the deterioration of victims' health condition in the aftermath of a disaster; e.g., a victim's health condition could deteriorate from mild to severe if not treated promptly. In this paper, we first present a novel queueing network to model this deterioration in health conditions. Second, we provide both analytical solutions and numerical illustrations for this queueing network. Finally, we formulate two resource allocation models in order to minimize the total expected death rate and total waiting time, respectively. Numerical examples are provided to illustrate the properties of optimal policies. [ABSTRACT FROM AUTHOR]