Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
Computers and Operations Research
A two-stage stochastic programming model for transportation network protection
Computers and Operations Research
Optimal scheduling of emergency roadway repair and subsequent relief distribution
Computers and Operations Research
Knowledge sharing in relief supply chains
International Journal of Networking and Virtual Organisations
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
A multi-criteria optimization model for humanitarian aid distribution
Journal of Global Optimization
A math-heuristic for the warehouse location-routing problem in disaster relief
Computers and Operations Research
Analytic network process in risk assessment and decision analysis
Computers and Operations Research
Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling
Expert Systems with Applications: An International Journal
Computers and Operations Research
Hi-index | 0.01 |
The distribution of emergency goods to a population affected by a disaster is one of the most fundamental operations in Humanitarian Logistics. In the case of a particularly disruptive event, parts of the distribution infrastructure (e.g., bridges, roads) can be damaged. This damage would make it impossible and/or unsafe for the vehicles to reach all the centers of demand (e.g., towns and villages). In this paper, we propose and solve the problem of planning for recovery of damaged elements of the distribution network, so that the consequent distribution planning would benefit the most. We apply the model, called RecHADS, to a case study based on the 2010 Haiti earthquake. We also show empirically the importance of coordinating recovery and distribution operations optimization.