Routing plan for the distribution of non-food humanitarian aid in the face of a major earthquake in Metropolitan Lima and Callao

A critical scenario of a magnitude 8.0 Mw earthquake is presented with epicenter in Lima, after which it is necessary to distribute non-food humanitarian aid to 1 795 735 victims in Lima City and Callao. The scenario works under the assumption that there are 22 warehouses that will supply 42 proposed substations. Each substation will distribute the goods to 50 nodes located in nearby parks. The affected population will have to approach the selected park in order to receive three kits of aid goods. We examine three classic heuristics: the savings algorithm, the two-phase method and the nearest neighbor algorithm. The selected heuristic is the two-step method: first assigning the nodes into groups, using the sweep algorithm, and then determining the route using a TSP model. After performing the heuristic to each of the 42 substations, we find that it reaches the 72 hour norm after making a total of 70 800 kilometers. Additionally, we present scenarios evaluating a smaller number of vehicles in the substations that present time slacks.