Health Care Management Science最新文献

Mobile dental clinics (MDCs) are suitable solutions for servicing people living in rural and urban areas that require dental healthcare. MDCs can provide dental care to the most vulnerable high-school students. However, scheduling MDCs to visit patients is critical to developing efficient dental programs. Here, we study a mobile dental clinic scheduling problem that arises from the real-life logistics management challenge faced by a school-based mobile dental care program in Southern Chile. This problem involves scheduling MDCs to treat high-school students at public schools while considering a fairness constraint among districts. Schools are circumscribed into districts, and by program regulations, at least 50% of the students in each district must receive dental care during the first semester. Fairness prevents some districts from waiting more time to receive dental care than others. We model the problem as a parallel machine scheduling problem with sequence-dependent setup costs and batch due dates and propose a mathematical model and a genetic algorithm-based solution to solve the problem. Our computational results demonstrate the effectiveness of our approaches in obtaining near-optimal solutions. Finally, dental program managers can use the methodologies presented in this work to schedule mobile dental clinics and improve their operations.

This study documents more than five years of analysis that drove the policy case, deployment, and retrospective evaluation for an innovative service model that enables Boston Emergency Medical Services (EMS) to respond quickly and effectively to investigation incidents in an area of heavy need in Boston. These investigation incidents are typically calls for service from passers-by or other third-party callers requesting that Boston EMS check in on individuals, often those who may appear to have an altered mental status or to be unhoused. First, this study reports the pre-intervention analytics in 2017 that built the policy case for service segmentation, a new Community Assistance Team designated "Squad 80" that primarily responds to investigation incidents in one broad area of the city with high rates of substance abuse and homelessness, helping patients who often refuse ambulance transport connect to social services. Second, this study reports a post-intervention, observational evaluation of its operational advantages and trade-offs. We observe that incidents involving the Community Assistance Team have significantly shorter response times and result in fewer transports to emergency departments than investigation incidents not involving the unit, leading to fewer ambulance unit-hours utilized across the system. This study documents the descriptive analytics that built the successful policy case for a substantive change in the healthcare-delivery supply chain in Boston and how this change offers operational advantages. It is written to be an accessible guide to the analysts and policy makers considering emergency services segmentation, an important frontier in equitable public-service delivery.

The United States (U.S.) Department of Health and Human Services is interested in increasing geographical equity in access to liver transplant. The geographical disparity in the U.S. is fundamentally an outcome of variation in the organ supply to patient demand (s/d) ratios across the country (which cannot be treated as a single unit due to its size). To design a fairer system, we develop a nonlinear integer programming model that allocates the organ supply in order to maximize the minimum s/d ratios across all transplant centers. We design circular donation regions that are able to address the issues raised in legal challenges to earlier organ distribution frameworks. This allows us to reformulate our model as a set-partitioning problem. Our policy can be viewed as a heterogeneous donor circle policy, where the integer program optimizes the radius of the circle around each donation location. Compared to the current policy, which has fixed radius circles around donation locations, the heterogeneous donor circle policy greatly improves both the worst s/d ratio and the range between the maximum and minimum s/d ratios. We found that with the fixed radius policy of 500 nautical miles (NM), the s/d ratio ranges from 0.37 to 0.84 at transplant centers, while with the heterogeneous circle policy capped at a maximum radius of 500 NM, the s/d ratio ranges from 0.55 to 0.60, closely matching the national s/d ratio average of 0.5983. Our model matches the supply and demand in a more equitable fashion than existing policies and has a significant potential to improve the liver transplantation landscape.

In this study, we address the problem of finding the best locations for mobile labs offering COVID-19 testing. We assume that people within known demand centroids have a degree of mobility, i.e., they can travel a reasonable distance, and mobile labs have a limited-and-variable service area. Thus, we define a location problem concerned with optimizing a measure representing the accessibility of service to its potential clients. In particular, we use the concepts of classical, gradual, and cooperative coverage to define a weighted sum of multiple accessibility indicators. We formulate our optimization problem via a mixed-integer linear program which is intractable by commercial solvers for large instances. In response, we designed a Biased Random-Key Genetic Algorithm to solve the defined problem; this is capable of obtaining high-quality feasible solutions over large numbers of instances in seconds. Moreover, we present insights derived from a case study into the locations of COVID-19 testing mobile laboratories in Nuevo Leon, Mexico. Our experimental results show that our optimization approach can be used as a diagnostic tool to determine the number of mobile labs needed to satisfy a set of demand centroids, assuming that users have reduced mobility due to the restrictions because of the pandemic.

Overcrowding of emergency departments is a global concern, leading to numerous negative consequences. This study aimed to develop a useful and inexpensive tool derived from electronic medical records that supports clinical decision-making and can be easily utilized by emergency department physicians. We presented machine learning models that predicted the likelihood of hospitalizations within 24 hours and estimated waiting times. Moreover, we revealed the enhanced performance of these machine learning models compared to existing models by incorporating unstructured text data. Among several evaluated models, the extreme gradient boosting model that incorporated text data yielded the best performance. This model achieved an area under the receiver operating characteristic curve score of 0.922 and an area under the precision-recall curve score of 0.687. The mean absolute error revealed a difference of approximately 3 hours. Using this model, we classified the probability of patients not being admitted within 24 hours as Low, Medium, or High and identified important variables influencing this classification through explainable artificial intelligence. The model results are readily displayed on an electronic dashboard to support the decision-making of emergency department physicians and alleviate overcrowding, thereby resulting in socioeconomic benefits for medical facilities.

Healthcare delivery in the United States has been characterized as overly reactive and dependent on emergency department care for safety net coverage, with opportunity for improvement around discharge planning and high readmissions and emergency department bounce-back rates. Community paramedicine is a recent healthcare innovation that enables proactive visitation of patients at home, often shortly after emergency department and hospital discharge. We establish the first optimization-based framework to study efficiencies in the management and operation of a community paramedicine program. The collective innovations of our modeling include i) a novel hierarchical objective function with the goals of fairly increasing patient welfare, lowering hospital costs, and reducing readmissions and emergency department visits, ii) a new constraint set that ensures priority same-day visits for emergent patients, and iii) a further extension of our model to determine the minimum supplemental resources necessary to ensure feasibility in a single optimization formulation. Our medical-need based objective function prioritizes patients based on their clinical features and seeks to select and schedule patient visits and route healthcare providers to maximize overall patient welfare while favoring shorter tours. We use our methods to develop managerial insights via computational experiments on a variety of test instances based on real data from a hospital system in Upstate New York. We are able to identify optimal and nearly optimal tours that efficiently select, route, and schedule patients in reasonable timeframes. Our results lead to insights that can support managerial decisions about establishing (and improving existing) community paramedicine programs.

The utilization of healthcare services serves as a barometer for current and future health outcomes. Even in countries with modern healthcare IT infrastructure, however, fragmentation and interoperability issues hinder the (short-term) monitoring of utilization, forcing policymakers to rely on secondary data sources, such as surveys. This deficiency may be particularly problematic during public health crises, when ensuring proper and timely access to healthcare acquires special importance. We show that, in specific contexts, online pharmacies' digital footprint data may contain a strong signal of healthcare utilization. As such, online pharmacy data may enable utilization surveillance, i.e., the monitoring of short-term changes in utilization levels in the population. Our analysis takes advantage of the scenario created by the first wave of the Covid-19 pandemic in Mainland China, where the virus' spread lead to pervasive and deep reductions of healthcare service utilization. Relying on a large sample of online pharmacy transactions with full national coverage, we first detect variation that is strongly consistent with utilization reductions across geographies and over time. We then validate our claims by contrasting online pharmacy variation against credit-card transactions for medical services. Using machine learning methods, we show that incorporating online pharmacy data into the models significantly improves the accuracy of utilization surveillance estimates.

In this paper, we present the first Assignment-Dial-A-Ride problem motivated by a real-life problem faced by medico-social institutions in France. Every day, disabled people use ride-sharing services to go to an appropriate institution where they receive personal care. These institutions have to manage their staff to meet the demands of the people they receive. They have to solve three interconnected problems: the routing for the ride-sharing services; the assignment of disabled people to institutions; and the staff size in the institutions. We formulate a general Assignment-Dial-A-Ride problem to solve all three at the same time. We first present a matheuristic that iteratively generates routes using a large neighborhood search in which these routes are selected with a mixed integer linear program. After being validated on two special cases in the literature, the matheuristic is applied to real instances in three different areas in France. Several managerial results are derived. In particular, it is found that the amount of cost reduction induced by the people assignment is equivalent to the amount of cost reduction induced by the sharing of vehicles between institutions.