Emergency logistics in disasters is fraught with planning and operational challenges, such as uncertainty about the exact nature and magnitude of the disaster, a lack of reliable information about the location and needs of victims, possible random supplies and donations, precarious transport links, scarcity of resources, and so on. This paper develops a new two-stage stochastic network flow model to help decide how to rapidly supply humanitarian aid to victims of a disaster within this context. The model takes into account practical characteristics that have been neglected by the literature so far, such as budget allocation, fleet sizing of multiple types of vehicles, procurement, and varying lead times over a dynamic multiperiod horizon. Attempting to improve demand fulfillment policy, we present some extensions of the model via state-of-art risk measures, such as semideviation and conditional value-at-risk. A simple two-phase heuristic to solve the problem within a reasonable amount of computing time is also suggested.Numerical tests based on the floods and landslides in Rio de Janeiro state, Brazil, show that the model can help plan and organise relief to provide good service levels in most scenarios, and how this depends on the type of disaster and resources. Moreover, we demonstrate that our heuristic performs well for real and random instances.

An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains Revised submission to

No abstract

Extreme events such as disasters cause partial or total disruption of basic services such as water, energy, communication and transportation. In particular, roads can be damaged or blocked by debris, thereby obstructing access to certain aected areas. Thus, restoration of the damaged roads is necessary to evacuate victims and distribute emergency commodities to relief centers or aected areas. The Crew Scheduling and Routing Problem (CSRP) addresses decisions in postdisaster situations with the aim of minimizing the time that aected areas remain inaccessible. The integration of crew scheduling and routing decisions makes this problem too complicated to be eectively solved for practical instances using mixed integer programming (MIP) formulations recently proposed in the literature. Therefore, we propose a branch-and-Benders-cut (BBC) algorithm that decomposes the integrated problem into a master problem (MP) with scheduling decisions and subproblems with routing decisions. Computational tests based on instances from the literature show that the proposed exact method improves the results of MIP formulations and other exact and metaheuristic methods proposed in literature. The BBC algorithm provides feasible solutions and optimality gaps for instances that thus far have not been possible to solve by exact methods in the literature.

In this paper, we deal with a vegetable crop supply problem with two main particularities: (i) the production must respect certain ecologically-based constraints and (ii) harvested crops can be stocked but only for a limited period of time, given that they are perishable. To model these characteristics, we develop a linear formulation in which each variable is associated to a crop rotation plan. This model contains a very large number of variables and is therefore solved with the aid of a column generation approach. Moreover, we also propose a two-stage stochastic programming with recourse model which takes into consideration that information on the demands might be uncertain. We provide a discussion of the results obtained via computational tests run on instances adapted from real-world data.

No abstract

No abstract

No abstract