| Literature DB >> 29247093 |
Michael Allen1, Kerry Pearn1, Emma Villeneuve1, Thomas Monks2, Ken Stein1, Martin James3.
Abstract
OBJECTIVES: The policy of centralising hyperacute stroke units (HASUs) in England aims to provide stroke care in units that are both large enough to sustain expertise (>600 admissions/year) and dispersed enough to rapidly deliver time-critical treatments (<30 min maximum travel time). Currently, just over half (56%) of patients with stroke access care in such a unit. We sought to model national configurations of HASUs that would optimise both institutional size and geographical access to stroke care, to maximise the population benefit from the centralisation of stroke care.Entities:
Keywords: organisation of health services; quality in health care; stroke
Mesh:
Year: 2017 PMID: 29247093 PMCID: PMC5736033 DOI: 10.1136/bmjopen-2017-018143
Source DB: PubMed Journal: BMJ Open ISSN: 2044-6055 Impact factor: 2.692
Figure 1Error in predicting admissions (as recorded in Sentinel Stroke Audit Programme) grouped by proximity to the closest neighbouring acute stroke unit (10 min bins). Points show median, with error bars indicating IQR. The left panel shows the absolute error in predicting admission numbers per year, while the right panel shows the absolute error as a percentage of actual admissions for each unit.
Figure 2The effect of changing the number of acute stroke units on average and maximum travel times. The left panel shows the best average and maximum travel times achieved by the algorithm. The middle panel shows the average travel times. The bold line represents the best result identified in any scenario. The dotted line shows the worst result identified for a non-dominated solution. The shaded area represents the effective region of trade-off between average travel time and other optimisation parameters. The right panel repeats these results for maximum travel time.
Figure 3The effect of changing the number of acute stroke units on minimum and maximum admissions to any single unit. The left panel shows the best admissions identified by the algorithm (it is better to have a higher minimum number of admissions and lower maximum admissions; that is, the smallest hospital should be as large as possible, and the largest hospital as small as possible). The middle panel shows minimum admission numbers (to the smallest unit in each scenario). The bold line represents the best result identified in any scenario. The dotted line shows the worst result identified for a non-dominated solution. The shaded area represents the effective region of trade-off between average minimum admissions and other optimisation parameters. The right panel repeats these results for maximum admissions in a scenario.
Figure 4The effect of changing the number of acute stroke units on the proportion of patients attending a unit with 600 admissions per year, the proportion of patients attending a unit within 30 min of home location and the proportion of patients attending a unit with 600 admissions per year and within 30 min of home location. The top left panel shows the best solutions for each identified by the algorithms. The top right panels shows the proportion of patients attending a unit with 600 admissions per year. The bold line represents the best result identified in any scenario. The dotted line shows the worst result identified for a non-dominated solution. The shaded area represents the effective region of trade-off between attending a unit with target admission numbers and other optimisation parameters. The bottom two panels repeat the analysis for the proportion of patients attending a unit within 30 min of home location and the proportion of patients attending a unit with 600 admissions per year and within 30 min of home location.
Figure 5Histogram of yearly admissions to hospitals. The histogram shows the distribution of admissions across 93 configurations in which annual admissions were kept within 600–2000 for all units.