
Leishmaniasis poses a significant global health concern due to the absence of vaccines for humans and high infection rates in some countries. It is classified as a neglected tropical disease. In 2022, roughly 85% of global visceral leishmaniasis cases were reported in seven countries: Brazil, Ethiopia, India, Kenya, Somalia, South Sudan, and Sudan. Despite Brazil's advanced medical capabilities compared to other affected regions, certain areas still witness a significant number of cases, prompting increased attention from researchers and raising concerns within the healthcare system. This study explores the application of artificial intelligence algorithms, particularly machine learning (ML) models to predict leishmaniasis outbreaks in selected Brazilian cities based on accumulated cases from 2007 to 2022, leveraging available meteorological data to enhance model accuracy. Our investigation concentrated on the following cities in Brazil: Fortaleza/CE, Teresina/PI, and S & atilde;o Luis/MA were chosen for the study of visceral leishmaniasis, whereas Manaus/AM, Rio Branco/AC, and Macap & aacute;/AP were selected for the study of tegumentary leishmaniasis, encompassing both cutaneous and mucocutaneous forms. Several Artificial Neural Network (ANN) architectures were evaluated, including a Simple Feedforward Neural Network (SFNN), a Deep Feedforward Neural Network (DFNN), and a Long Short-Term Memory (LSTM) recurrent neural network. Additionally, the Support Vector Machine (SVM), specifically the Support Vector Regression (SVR), was tested. Various metrics were used to identify the most effective models, in which the Root Mean Squared Error (RMSE) was the primary one. The results highlight the significance of meteorological data as a crucial factor in ML models for predicting leishmaniasis outbreaks, while also emphasizing the importance of fine-tuning these models to achieve greater accuracy. Finally, data and the pseudo-code of the models are accessible through an open repository to encourage further studies in this area.
Purpose: This study aims to develop a heuristic for an outpatient appointment system considering patient classification. Design/methodology/approach: The proposed heuristic was applied in simulations with eighteen scenarios, combining different environmental factors. Total cost was adopted as a performance metric, composed of the patient's wait time and the service provider's idleness and overtime. The patients were divided into two classes according to their no-show probability, in an arrivals sequence with a binomial distribution. As a significance test of the results, Bonferroni-adjusted repeated measures analysis was applied. Findings: Having Dome rule as baseline, an increase in performance in terms of total cost (TC) TC ) was observed, which varied between 0.46 % and 5.94 % among the means of the simulated environments, validated using the proposed significance test. The greatest benefits were obtained in the scenarios with lower ratios between service provider costs and patient costs (CR), CR ), as well as lower coefficients of variation for service times (Cv). It was also found that the heuristic is more efficient when patients from the class with the highest no-show rate predominate in the session. Originality: The single study identified in the literature that contemplates recalculations adopts deterministic service times to make its model viable. The present research, in turn, makes more realistic assumptions for the simulated environments, considering the variables and probability distributions most commonly observed in practical contexts Practical implications: The proposed heuristic provided a significant increase in performance for some combinations of environmental factors analyzed, preserving flexibility in the choice of appointment slots and covering a wide range of healthcare services found in practice.
In many countries, the rapid aging of the population leads to an additional burden on already stretched long-term care systems. This often manifests itself in excessive waiting times for long-term care centers, and in abandonments (i.e., patients passing away while they are waiting). Interestingly, in practice, long waiting times are not caused by a lack of available total capacity in the system, but by systematic inefficiencies in the allocation of patients, each with their personal preferences and (in)flexibility, to geographically distributed care centers.Motivated by this, we propose a new and easy-to-implement method for the optimal allocation of patients-in-need to nursing homes, balancing the trade-off between the waiting time performance and the individual patients’ preferences and levels of flexibility. The optimal placement policy found by solving a Markov Decision Process demonstrates that for small instances, the mean optimality gap of the allocation model is equal to 1. 3%. We validate a simulation model for a real-life use case of allocating somatic patients to nursing homes in the Amsterdam area. The results show that if more patient replacements are approved, the allocation model can reduce the abandonment fraction under the current policy from 32.2% to 7.4% and waiting times at the same time. Moreover, with the allocation model individual preferences can be served better, which thus provides a powerful means to face the increasing need for patient-centered and sustainable long-term care solutions.
Layout design is considered a crucial aspect of healthcare architecture and its goal is to allow easy access to essential hospital services and effective patient care. Literature suggests that modifying or redesigning the inpatient unit layout is one of the ways to maximize patient visibility in an inpatient layout. However, prior work has been descriptive in nature and limited in their ability to derive optimal layouts. To fill this gap, we propose a non-linear optimization model that optimizes both equity and effectiveness in visibility by jointly determining the optimal location of two nurses and patient bed positions in multiple rooms. The bi-objective model is then converted into a single objective model utilizing the epsilon-constrained method, with equity in the objective function and effectiveness as a constraint. Patient visibility is estimated using a ray-casting algorithm that also considers nurses' line of sight, door positions, and obstruction levels. A progressive refinement algorithm embedded in the Particle Swarm Optimization framework is proposed to efficiently solve this model. Our results suggest that optimizing bed position in conjunction with nurse position can enhance equity by over 45.2% compared to just optimizing the nurse position. Similarly, angular layouts are superior to linear layout by up to 53% in patient equity. We also notice that increasing spatial distance between nurses in angular layouts can further increase equity. Our approach provides valuable insights and can serve as a benchmark tool for hospitals looking to improve the design of their inpatient units that promote patient safety and high-quality care.
In a home care setting, high-quality care is typically associated with continuity of care. In addition, the increasing pressure due to labor shortages calls for cost-efficient operations. This paper focuses on obtaining cost-efficient daily schedules over a longer time horizon, with balanced shift lengths, while ensuring continuity of care (using the continuity of care index). To address this challenge, we propose a novel method based on blueprint routes. This method generates daily schedules by constructing optimized shifts and routes with regard to travel time, (time window) waiting time, and shift costs based on hourly wages. To ensure continuity of care, the daily scheduling decisions are strategically guided using the concept named blueprint routes. The blueprint routes are pre-optimized (partial) routes that help to align the daily schedules to achieve continuity of care in the subsequent nurse-to-shift assignment. Model-based evolutionary algorithms are employed to overcome the NP-hardness of the routing problem and nurse-to-shift assignment. Real-life-based numerical experiments demonstrate that continuity of care does not have to compromise home care schedule costs significantly.