Improving patient transportation in hospitals using a mixed-integer programming model

IF 1.5 Q3 HEALTH CARE SCIENCES & SERVICES Operations Research for Health Care Pub Date : 2019-12-01 DOI:10.1016/j.orhc.2019.100202
Sara Séguin , Yoan Villeneuve , Charles-Hubert Blouin-Delisle
{"title":"Improving patient transportation in hospitals using a mixed-integer programming model","authors":"Sara Séguin ,&nbsp;Yoan Villeneuve ,&nbsp;Charles-Hubert Blouin-Delisle","doi":"10.1016/j.orhc.2019.100202","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates the current patient transportation between care units in a large hospital to determine possible solutions to reduce total completion times of demands. The goal is to avoid major changes in the current staff schedules. Historical data of the service calls is available and an in-depth analysis is conducted to identify popular routes and current assignment of demands to patient transport employees. We present a mixed-integer model to determine the best distribution of the employees throughout the most popular routes of the hospital to minimize costs. Experiments are conducted on real data from CHU de Québec-Université Laval, HEJ, in the province of Québec, Canada. Results obtained from assigning specific employees to routes instead of the current method, which consists at assigning employees to all of the hospital are compared and show that there is a gain in doing so.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2019.100202","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research for Health Care","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211692318301553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"HEALTH CARE SCIENCES & SERVICES","Score":null,"Total":0}
引用次数: 6

Abstract

This paper investigates the current patient transportation between care units in a large hospital to determine possible solutions to reduce total completion times of demands. The goal is to avoid major changes in the current staff schedules. Historical data of the service calls is available and an in-depth analysis is conducted to identify popular routes and current assignment of demands to patient transport employees. We present a mixed-integer model to determine the best distribution of the employees throughout the most popular routes of the hospital to minimize costs. Experiments are conducted on real data from CHU de Québec-Université Laval, HEJ, in the province of Québec, Canada. Results obtained from assigning specific employees to routes instead of the current method, which consists at assigning employees to all of the hospital are compared and show that there is a gain in doing so.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用混合整数规划模型改进医院的病人运输
本文调查了目前在一家大型医院的护理单位之间的病人运输,以确定可能的解决方案,以减少总完成时间的需求。其目标是避免对当前的工作人员时间表进行重大更改。服务电话的历史数据是可用的,并进行了深入的分析,以确定热门路线和当前分配给病人运输员工的需求。我们提出了一个混合整数模型来确定员工在医院最受欢迎的路线上的最佳分配,以最大限度地降低成本。实验是在加拿大曲梅省的曲梅-拉瓦尔大学的真实数据上进行的。通过将特定员工分配到路线而不是将员工分配到所有医院的现行方法所获得的结果进行了比较,并表明这样做有好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Operations Research for Health Care
Operations Research for Health Care HEALTH CARE SCIENCES & SERVICES-
CiteScore
3.90
自引率
0.00%
发文量
9
审稿时长
69 days
期刊最新文献
Editorial Board Preference-based allocation of patients to nursing homes Balancing continuity of care and home care schedule costs using blueprint routes Outpatient appointment systems: A new heuristic with patient classification A modeling framework for evaluating proactive and reactive nurse rostering strategies — A case study from a Neonatal Intensive Care Unit
×
引用
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