Geographic Virtual Pooling of Hospital Resources: Data-Driven Trade-off Between Waiting and Traveling
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Problem definition: Patient-level data from 72 magnetic resonance imaging (MRI) hospitals in Ontario, Canada from 2013 to 2017 show that over 60% of patients exceeded their wait time targets. We conduct a data-driven analysis to quantify the reduction in the patient fraction exceeding (FET) target for MRI services through geographic virtual resource-sharing while limiting incremental driving time. We present a data-driven method to solve the geographic pooling problem of partitioning 72 hospitals with heterogeneous patients with different wait time targets located in a two-dimensional region into a set of clusters. Methodology/results: We propose an “augmented-priority rule,” which is a sequencing rule that balances the patient’s initial priority class and the number of days until her wait time target. We then use neural networks to predict patient arrival and service times. We combine this predicted information and the sequencing rule to implement “advance scheduling,” which informs the patient of her treatment day and location when requesting an MRI scan. We then optimize the number of geographic resource pools among the 72 hospitals using genetic algorithms. Our resource-pooling model lowers the FET from 66% to 36% while constraining the average incremental travel time below three hours. In addition, our model shows that only 10 additional scanners are needed to achieve 10% FET, whereas 50 additional scanners would be needed without resource sharing. Over 70% of the hospitals are not worse off financially. Each individual hospital, measured over at least two weeks, achieves a higher machine utilization and a lower FET. Managerial implications: Our paper provides a practical, data-driven geographical resource-sharing model that hospitals can readily implement. Our method achieves a near-optimal solution with low computational complexity. Using smart data-driven scheduling, a little extra capacity placed at the right location is all we need to achieve the desired FET under geographic resource-sharing. Funding: This paper is supported by the following grant: Canadian Institutes of Health Research (CIHR) [Grant CIHR-950-231935]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1225 .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it