Logistics operations have a direct impact on the effectiveness of the humanitarian relief operations and the survival of the population, supplying all demands in a short period of time using the available limited resources. This work addresses the Emergency k-Location Routing Problem (EkLRP) where humanitarian and relief aid has to be distributed from medical infrastructure to the affected people by routing emergency-aimed vehicles minimizing the time required to provide the humanitarian aid. This work proposes a Simulated Annealing with temperature reset in order to promote diversification as well as for escaping from local optima. The numerical experiments indicate that the metaheuristic approach proposed to solve the EkLRP reports high-quality solutions in reasonable computational times.
CITATION STYLE
Dávila de León, A., Lalla-Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2020). A Simulated Annealing-Based Approach for Aid Distribution in Post-disaster Scenarios. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12013 LNCS, pp. 335–343). Springer. https://doi.org/10.1007/978-3-030-45093-9_41
Mendeley helps you to discover research relevant for your work.