Background: Disasters have caused suffering across the world throughout history. Different types of disaster events can manifest themselves in different ways, originating from natural phenomena, human actions and their interconnected interactions. In recent years, organizations in charge of disaster management have faced a series of challenges in humanitarian logistics, leading to an increasing consideration of the use of models of prioritization, in most multi-criteria models, to define the best alternatives for more assertive and strategic decision-making. Methods: This article aims to conduct a systematic review of the literature on the application of prioritization models in humanitarian logistics. To this end, an analysis was carried out of 40 articles, indexed in the Scopus or Web of Science databases. Results: The descriptive analysis revealed that the majority of applications are aimed at dealing with sudden-onset natural-induced disasters. However, there are still gaps in relevant areas, such as addressing inventory management problems at a tactical decision level. Conclusions: The development of prioritization models necessitates the integration of various methodologies, combining optimization models with multi-criteria decision analysis to yield superior outcomes. It is advised to incorporate four distinct criteria—efficiency, effectiveness, equity, and sustainability—to ensure a comprehensive assessment of the decision-making process.
O Sistema de Atendimento Móvel de Urgência (SAMU) no Brasil é um sistema médico emergencial de responsabilidade do poder público, em que a demanda de usuários em uma região urbana é usualmente separada por subregiões e classes de chamados emergenciais. Essa demanda pode mudar de forma significativa ao longo do dia, geograficamente e temporalmente, devido à sua natureza aleatória, mas também devido aos diferentes padrões de comportamentos da população ao longo do dia. Por exemplo, tipicamente há menos demanda durante a noite do que de dia. Os objetivos deste trabalho são: verificar se o conhecido modelo hipercubo de filas espacialmente distribuídas é adequado para analisar medidas de desempenho do SAMU, tais como tempos médios de resposta aos usuários, e utilizar este modelo para analisar múltiplas alternativas de localização das ambulâncias, explorando variações importantes da demanda e do serviço ao longo do dia. Para verificar a viabilidade e a aplicabilidade desta abordagem, foi realizado um estudo de caso no SAMU de Ribeirão Preto-SP.
The hypercube model is a useful descriptive tool to evaluate emergency services such as firefighters, police, and emergency medical services where geographically distributed vehicles and personnel serve users in emergencies. This study proposes an extension of the hypercube model to represent a dispatch policy in which advanced equipped servers serve solely life-threatening calls (called dedicated servers). The proposed approach is applied to two case studies of public medical emergency services in two different cities in Brazil and validated with discrete-event simulations. The computational experiments show the proposed model as more sensitive to respond to more life-threatening requests than other hypercube models in the literature, serving more of these requests under increased demand. In addition, to reduce the number of equilibrium equations and, consequently, the computational effort of the hypercube model, an aggregate model is shown based on the grouping of homogeneous servers located in the same station. The aggregation policy does not generate additional losses in the accuracy of the model, as shown through several experiments.
We improve the shift-scheduling process by using nonstationary queueing models to evaluate schedules and two heuristics to generate schedules. Firstly, we improved the fitness function and the initial population generation method for a benchmark genetic algorithm in the literature. We also proposed a simple local search heuristic. The improved genetic algorithm found solutions that obey the delay probability constraint more often. The proposed local search heuristic also finds feasible solutions with a much lower computational expense, especially under low arrival rates. Differently from a genetic algorithm, the local search heuristic does not rely on random choices. Furthermore, it finds one final solution from one initial solution, rather than from a population of solutions. The developed local search heuristic works with only one well-defined goal, making it simple and straightforward to implement. Nevertheless, the code for the heuristic is simple enough to accept changes and cope with multiple objectives.