医院资源的地理虚拟池:数据驱动的等待和出行之间的权衡

Yangzi Jiang, Hossein Abouee Mehrizi, Jan A. Van Mieghem
{"title":"医院资源的地理虚拟池:数据驱动的等待和出行之间的权衡","authors":"Yangzi Jiang, Hossein Abouee Mehrizi, Jan A. Van Mieghem","doi":"10.1287/msom.2023.1225","DOIUrl":null,"url":null,"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 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Geographic Virtual Pooling of Hospital Resources: Data-Driven Trade-off Between Waiting and Traveling\",\"authors\":\"Yangzi Jiang, Hossein Abouee Mehrizi, Jan A. Van Mieghem\",\"doi\":\"10.1287/msom.2023.1225\",\"DOIUrl\":null,\"url\":null,\"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 .\",\"PeriodicalId\":119284,\"journal\":{\"name\":\"Manufacturing & Service Operations Management\",\"volume\":\"59 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manufacturing & Service Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2023.1225\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2023.1225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

问题定义:2013年至2017年,加拿大安大略省72家磁共振成像(MRI)医院的患者数据显示,超过60%的患者超过了他们的等待时间目标。我们进行了一项数据驱动分析,通过地理虚拟资源共享来量化减少MRI服务的患者分数超过(FET)目标,同时限制增量驾驶时间。本文提出了一种数据驱动的方法来解决地理池问题,将位于二维区域的72家具有不同等待时间目标的异构患者的医院划分为一组聚类。方法/结果:我们提出了一种“增强优先级规则”,这是一种排序规则,可以平衡患者的初始优先级和等待时间目标的天数。然后我们使用神经网络来预测病人到达和服务时间。我们将这些预测信息与排序规则结合起来,实现“提前调度”,当患者要求进行核磁共振扫描时,通知她的治疗日期和地点。然后,我们使用遗传算法优化72家医院的地理资源池数量。我们的资源池模型将FET从66%降低到36%,同时将平均增量旅行时间限制在3小时以下。此外,我们的模型表明,只需要10个额外的扫描仪来实现10%的场效应效应,而没有资源共享将需要50个额外的扫描仪。超过70%的医院的财政状况并不差。在至少两周的时间里,每家医院都实现了更高的机器利用率和更低的场效应晶体管。管理意义:我们的论文提供了一个实用的、数据驱动的地理资源共享模型,医院可以很容易地实施。我们的方法以较低的计算复杂度实现了近似最优解。利用智能数据驱动调度,在地理资源共享的情况下,在适当的位置放置一点额外的容量,就可以实现预期的场效应效应。资助:本文由以下基金资助:加拿大卫生研究院(CIHR)[赠款CIHR-950-231935]。补充材料:在线附录可在https://doi.org/10.1287/msom.2023.1225上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Geographic Virtual Pooling of Hospital Resources: Data-Driven Trade-off Between Waiting and Traveling
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 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Physician Adoption of AI Assistant Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price Loyalty Currency and Mental Accounting: Do Consumers Treat Points Like Money? Dealership or Marketplace with Fulfillment Services: A Dynamic Comparison Introduction: Frontiers in Operations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1