Characterizing Logistics Operations Within a Federal Staging Area for Hurricane Response: A Qualitative Analysis of Federal, State and Local Perspectives

A successful deployment of logistics operations following a disaster is a collective contribution of federal, state, and local entities to ascertain an efficient and effective response. This research analyzes data from interviews with disaster response logistics experts from these entities. The objective is to investigate the information sources and planning processes used in these organizations to plan vehicle routes for critical resource deliveries to impacted areas. Special attention is directed to the impacts of incomplete knowledge of infrastructure status, such as road disruptions due to debris or flooding. Supported by both qualitative and quantitative evidence, the study finds that incomplete knowledge of infrastructure status poses serious critical transportation risks such as delivery delays in disaster relief distribution. This research reveals both similarities and differences in logistical decision-making among these organization types and emphasizes the need for improved information sharing and coordination among emergency response organizations. The findings of this research are expected to guide future initiatives aimed at disaster relief routing thereby enhancing emergency response capabilities and outcomes

Characterizing Logistics Operations Within a Federal Staging Area for Hurricane Response: A Qualitative Analysis of Federal, State and Local Perspectives

A successful deployment of logistics operations following a disaster is a collective contribution of federal, state, and local entities to ascertain an efficient and effective response. This research analyzes data from interviews with disaster response logistics experts from these entities. The objective is to investigate the information sources and planning processes used in these organizations to plan vehicle routes for critical resource deliveries to impacted areas. Special attention is directed to the impacts of incomplete knowledge of infrastructure status, such as road disruptions due to debris or flooding. Supported by both qualitative and quantitative evidence, the study finds that incomplete knowledge of infrastructure status poses serious critical transportation risks such as delivery delays in disaster relief distribution. This research reveals both similarities and differences in logistical decision-making among these organization types and emphasizes the need for improved information sharing and coordination among emergency response organizations. The findings of this research are expected to guide future initiatives aimed at disaster relief routing thereby enhancing emergency response capabilities and outcomes

A memetic algorithm for location-routing problem with time windows for the attention of seismic disasters a case study from Bucaramanga, Colombia

Introduction− In recent years, a great part of the population has been affected by natural and man-caused disasters. Hence, evacua-tion planning has an important role in the reduction of the number of victims during a natural disaster. Objective−In order to contribute to current studies of operations research in disaster management, this paper addresses evacuation planning of urban areas by using buses to pick up affected people after an earthquake.Methodology−The situation is modeled using Location-Routing Problem with Time Windows (LRPTW) to locate emergency shelters and identify evacuation routes that meet attention time constraints. To solve the LRPTW problem, a memetic algorithm (MA) is de-signed to minimize the total response time during an evacuation. The algorithm is not only validated using instances of literature, but also with the assessment of a case study of a seismic event in Bucaramanga, Colombia.Results and conclusions− The main contribution of this article is the development of a memetic algorithm for the solution of the proposed model that allows to solve real-size instances. The hybrid initialization of the MA prevents an early convergence by combin-ing randomness and a heuristic technique. Computational results indicate that the MA is a viable approach for the LRPTW solution. Likewise, a case study is presented for the city of Bucaramanga in order to validate the proposed model. Two scenarios are simulated showing that the management of the time windows (homogeneous or random) directly influences the solution and affects the objec-tive function. From a practical perspective, the location-routing problem must consider other criteria such as the cost of evacua-tion, including the attention delay cost, and the cost of opening shelters and routing.Introducción− En años recientes gran parte de la población ha sido afectada por desastres tanto naturales como antrópicos. Por esto, la planificación de la evacuación juega un papel importante en la reduc-ción del número de víctimas ante un desastre natural. Objetivo− Con el propósito de contribuir a los estudios actuales desde la investigación de operaciones en gestión de desastres, esta inves-tigación aborda la planificación de la evacuación de áreas urbanas usando buses para recoger afectados.Metodología− El problema se modela mediante un problema de localización-ruteo con ventanas de tiempo (LRPTW) para determinar el número y la ubicación de los albergues las y rutas de recolección para evacuación, cumpliendo restricciones en tiempo de atención. Para solucionar el LRPTW, se diseña un algoritmo memético (MA) que minimiza el tiempo total de respuesta en la evacuación. El algo-ritmo es validado en instancias de la literatura y mediante un caso de estudio de un evento sísmico en Bucaramanga (Colombia).Resultados y conclusiones− La contribución principal de este ar-tículo es el desarrollo de un MA para solucionar el modelo propuesto, que permite resolver instancias de tamaño real. La inicialización híbrida del MA evita una convergencia temprana, combinando alea-toriedad con una técnica heurística. Los resultados computacionales indican que el MA es un enfoque viable para solucionar el LRPTW. Así mismo, se presenta un caso de estudio en Bucaramanga para validar el modelo propuesto. Se plantean dos escenarios de desastre, evidenciando que el tratamiento que se da a las ventanas de tiempo (homogénea o aleatoria) influye directamente en la solución y afec-ta la función objetivo. Desde un enfoque práctico, el problema debe considerar otros criterios que pueden influir en la planificación de la evacuación, como el costo de la evacuación, costo de la demora en la atención, costo de apertura y de ruteo

Un algoritmo memético para el problema de localización-ruteo con ventanas de tiempo para la atención de desastres sísmicos: un caso de estudio de Bucaramanga, Colombia

Introduction: In recent years, a great part of the population has been affected by natural and man-caused disasters. Hence, evacuation planning has an important role in the reduction of the number of victims during a natural disaster. Objective: In order to contribute to current studies of operations research in disaster management, this paper addresses evacuation planning of urban areas by using buses to pick up affected people after an earthquake. Methodology: The situation is modeled using Location-Routing Problem with Time Windows (LRPTW) to locate emergency shelters and identify evacuation routes that meet attention time constraints. To solve the LRPTW problem, a memetic algorithm (MA) is designed to minimize the total response time during an evacuation. The algorithm is not only validated using instances of literature but also with the assessment of a case study of a seismic event in Bucaramanga, Colombia. Results and conclusions: The main contribution of this article is the development of a memetic algorithm for the solution of the proposed model that allows to solve real-size instances. The hybrid initialization of the MA prevents an early convergence by combining randomness and a heuristic technique. Computational results indicate that the MA is a viable approach for the LRPTW solution. Likewise, a case study is presented for the city of Bucaramanga in order to validate the proposed model. Two scenarios are simulated showing that the management of the time windows (homogeneous or random) directly influences the solution and affects the objective function. From a practical perspective, the location-routing problem must consider other criteria such as the cost of evacuation, including the attention delay cost, and the cost of opening shelters and routing.Introducción: En años recientes gran parte de la población ha sido afectada por desastres tanto naturales como antrópicos. Por esto, la planificación de la evacuación juega un papel importante en la reducción del número de víctimas ante un desastre natural. Objetivo: Con el propósito de contribuir a los estudios actuales desde la investigación de operaciones en gestión de desastres, esta investigación aborda la planificación de la evacuación de áreas urbanas usando buses para recoger afectados. Metodología: El problema se modela mediante un problema de localización-ruteo con ventanas de tiempo (LRPTW) para determinar el número y la ubicación de los albergues las y rutas de recolección para evacuación, cumpliendo restricciones en tiempo de atención. Para solucionar el LRPTW, se diseña un algoritmo memético (MA) que minimiza el tiempo total de respuesta en la evacuación. El algoritmo es validado en instancias de la literatura y mediante un caso de estudio de un evento sísmico en Bucaramanga (Colombia). Resultados y conclusiones: La contribución principal de este artículo es el desarrollo de un MA para solucionar el modelo propuesto, que permite resolver instancias de tamaño real. La inicialización híbrida del MA evita una convergencia temprana, combinando aleatoriedad con una técnica heurística. Los resultados computacionales indican que el MA es un enfoque viable para solucionar el LRPTW. Así mismo, se presenta un caso de estudio en Bucaramanga para validar el modelo propuesto. Se plantean dos escenarios de desastre, evidenciando que el tratamiento que se da a las ventanas de tiempo (homogénea o aleatoria) influye directamente en la solución y afecta la función objetivo. Desde un enfoque práctico, el problema debe considerar otros criterios que pueden influir en la planificación de la evacuación, como el costo de la evacuación, costo de la demora en la atención, costo de apertura y de ruteo

Construcción de planes de restauración de vías orientados a facilitar operaciones de logística humanitaria

Disruptions in the transportation network are one of the hardest consequences of a disaster. They have the potential of hampering the performance of emergency aid organizations, reducing the opportunities of saving critical victims during response and recovery phases. The strategic restoration of road network implies the prioritization of those a ected roads whose rehabilitation would reduce travel times, allowing emergency relief vehicles, civilians and restoration machines to move faster through the network. Humanitarian Road Restoration Problem (HURREP) is a relatively new topic in comparison with other research topics on disaster management. In this study, we present a mathematical model which schedules and routes restoration machines and relief vehicles working in parallel on the same network. We adopt the minimization of weighted sum of attention times to communities as the objective function, seeking for a restoration plan totally dedicated to provide support to relief plan. Among other features, our methods are able to deal with di erent relief modes working in parallel, road disruptions that are naturally removed over time (e.g. by evaporation) and vehicle-dependent starting times. We also provided an heuristic algorithm able to solve large size instances of our problem in less than the 2.7% of the runtime limit suggested by the Administrative Department for Prevention, Attention, and Recovery from Disasters in Antioquia, Colombia (DAPARD). We validated the applicability of our methods on real world disaster scenarios through a study case based on the Mojana's oods occurred in northern Colombia on the 2010-2011.MaestríaMagister en Ingeniería Industria

Quantifying restoration costs in the aftermath of an extreme event using system dynamics and dynamic mathematical modeling approaches

Extreme events such as earthquakes, hurricanes, and the like, lead to devastating effects that may render multiple supply chain critical infrastructure elements inoperable. The economic losses caused by extreme events continue well after the emergency response phase has ended and are a key factor in determining the best path for post-disaster restoration. It is essential to develop efficient restoration and disaster management strategies to ameliorate the losses from such events. This dissertation extends the existing knowledge base on disaster management and restoration through the creation of models and tools that identify the relationship between production losses and restoration costs. The first research contribution is a system dynamics inoperability model that determines inputs, outputs, and flows for roadway networks. This model can be used to identify the connectivity of road segments and better understand how inoperability contributes to economic consequences. The second contribution is an algorithm that integrates critical infrastructure data derived from bottom-up cost estimation technique as part of an object-oriented software tool that can be used to determine the impact of system disruptions. The third contribution is a dynamic mathematical model that establishes a framework to estimate post-disaster restoration costs from a whole system perspective. Engineering managers, city planners, and policy makers can use the methodologies developed in this research to develop effective disaster planning schemas and to prioritize post-disaster restoration operations --Abstract, page iv

The SNS logistics network design : location and vehicle routing.

Large-scale emergencies caused by earthquake, tornado, pandemic flu, terrorism attacks and so on can wreak havoc to communities. In order to mitigate the impact of the events, emergency stockpiles of food, water, medicine and other materials have been set up around the US to be delivered to the affected areas during relief operations. One type of stockpile is called the Strategic National Stockpile (SNS). The SNS logistics network is designed to have multiple stages of facilities, each of which is managed by different levels of governmental authorities - federal, state and local authorities. The design of a logistics network for delivery of the SNS materials within a state are explored in this dissertation. There are three major areas of focus in this dissertation: (1) the SNS facility location model, which is used to determine sites for locating Receiving, Staging and Storage (RSS) and Regional Distribution Nodes (RDNs) to form a logistics network to deliver relief material to Points of Demand (PODs), where the materials are directly delivered to the affected population; (2) the SNS Vehicle Routing Problem (VRP), which is used to assist the SNS staff in determining the numbers of various types of trucks, and the routing schedules of each truck to develop an operational plan for delivering the required relief materials to the assigned PODs within the required duration; (3) the location-routing analysis of emergency scenarios, in which the facility location model and the VRP solution are integrated through the use of a computer program to run on several assumed emergency scenarios. Using real data from the department of public health in the Commonwealth of Kentucky, a transshipment and location model is formulated to determine the facility locations and the transshipment quantities of materials; a multiple-vehicle routing model allowing split deliveries and multiple routes per vehicle that must be completed within a required duration is formulated to determine the routing and scheduling of trucks. The facility location model is implemented using Microsoft Solver Foundation and C#. An algorithm combining the Clark and Wright saving algorithm and Simulated Annealing is designed and implemented in C# to solve the VRP. The algorithm can determine whether there is shortage of transportation capacity, and if so, how many of various types of trucks should be added for optimal performance. All the solution algorithms are integrated into a web-based SNS planning tool. In the location-routing analysis of emergency scenarios, a binary location model and an algorithm for solving VRP solution are integrated as a computer program to forecast the feasibility of distribution plans and the numbers of required trucks of various types. The model also compares the costs and benefits of direct and indirect shipment. A large-scale emergency scenario in which a specific type of vaccine is required to be delivered to the entire state of Kentucky is considered. The experiments are designed based on the real data provided by the Kentucky state government. Thus the experimental results provide valuable suggestions for future SNS preparedness planning

Optimized location-allocation of earthquake relief centers using PSO and ACO, complemented by GIS, clustering, and TOPSIS

© 2018 by the authors. After an earthquake, it is required to establish temporary relief centers in order to help the victims. Selection of proper sites for these centers has a significant effect on the processes of urban disaster management. In this paper, the location and allocation of relief centers in district 1 of Tehran are carried out using Geospatial Information System (GIS), the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) decision model, a simple clustering method and the two meta-heuristic algorithms of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). First, using TOPSIS, the proposed clustering method and GIS analysis tools, sites satisfying initial conditions with adequate distribution in the area are chosen. Then, the selection of proper centers and the allocation of parcels to them are modelled as a location/allocation problem, which is solved using the meta-heuristic optimization algorithms. Also, in this research, PSO and ACO are compared using different criteria. The implementation results show the general adequacy of TOPSIS, the clustering method, and the optimization algorithms. This is an appropriate approach to solve such complex site selection and allocation problems. In view of the assessment results, the PSO finds better answers, converges faster, and shows higher consistency than the ACO

Double ant colony system to improve accessibility after a disaster

We propose a novel double ant colony system to deal with accessibility issues after a natural or man-made disaster. The aim is to maximize the number of survivors that reach the nearest regional center (center of economic and social activity in the region) in a minimum time by planning which rural roads damaged by the disaster should be repaired given the available financial and human resources. The proposed algorithm is illustrated by means of a large instance based on the Haiti natural disasters in August-September 2008