Shelf-space optimization models in decentralized automated dispensing cabinets

IF 1.5 Q3 HEALTH CARE SCIENCES & SERVICES
Operations Research for Health Care Pub Date : 2018-12-01 Epub Date: 2018-04-05 DOI:10.1016/j.orhc.2018.03.005
Nazanin Esmaili , Bryan A. Norman , Jayant Rajgopal
{"title":"Shelf-space optimization models in decentralized automated dispensing cabinets","authors":"Nazanin Esmaili ,&nbsp;Bryan A. Norman ,&nbsp;Jayant Rajgopal","doi":"10.1016/j.orhc.2018.03.005","DOIUrl":null,"url":null,"abstract":"<div><p><span>We propose a mixed integer programming (MIP) model to help clinicians store medications and medical supplies optimally in space-constrained, decentralized Automated Dispensing Cabinets (ADCs) located on hospital patient floors. We also propose a second MIP model that addresses human errors associated with the selection of </span>pharmaceuticals from floor storage, and not only selects the best set of medications for storage but also determines their optimal layout within the cabinet. To improve the computational performance of these MIP models, we investigate several valid inequalities and relaxations that allow us to solve large, real-world instances in reasonable times. These models are applicable to very general ADCs and are illustrated using real-world data from ADCs at hospitals. Our results indicate that using these models can significantly reduce the time spent by clinical staff on routine logistical functions, while making efficient use of limited space and decreasing risks associated with errors in the selection of medication.</p></div>","PeriodicalId":46320,"journal":{"name":"Operations Research for Health Care","volume":"19 ","pages":"Pages 92-106"},"PeriodicalIF":1.5000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.orhc.2018.03.005","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research for Health Care","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211692317300711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/4/5 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"HEALTH CARE SCIENCES & SERVICES","Score":null,"Total":0}
引用次数: 8

Abstract

We propose a mixed integer programming (MIP) model to help clinicians store medications and medical supplies optimally in space-constrained, decentralized Automated Dispensing Cabinets (ADCs) located on hospital patient floors. We also propose a second MIP model that addresses human errors associated with the selection of pharmaceuticals from floor storage, and not only selects the best set of medications for storage but also determines their optimal layout within the cabinet. To improve the computational performance of these MIP models, we investigate several valid inequalities and relaxations that allow us to solve large, real-world instances in reasonable times. These models are applicable to very general ADCs and are illustrated using real-world data from ADCs at hospitals. Our results indicate that using these models can significantly reduce the time spent by clinical staff on routine logistical functions, while making efficient use of limited space and decreasing risks associated with errors in the selection of medication.

分散式自动化点胶柜货架空间优化模型
我们提出了一个混合整数规划(MIP)模型,以帮助临床医生在位于医院病人楼层的空间受限的分散自动配药柜(adc)中最佳地存储药物和医疗用品。我们还提出了第二个MIP模型,该模型解决了与从地板存储中选择药物相关的人为错误,不仅选择了最佳的药物存储集,而且确定了它们在机柜中的最佳布局。为了提高这些MIP模型的计算性能,我们研究了几个有效的不等式和松弛,这些不等式和松弛使我们能够在合理的时间内解决大型的、真实的实例。这些模型适用于非常一般的adc,并使用医院adc的实际数据进行说明。我们的研究结果表明,使用这些模型可以显著减少临床工作人员在日常后勤功能上花费的时间,同时有效利用有限的空间并降低与药物选择错误相关的风险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research for Health Care
Operations Research for Health Care HEALTH CARE SCIENCES & SERVICES-
CiteScore
3.90
自引率
0.00%
发文量
9
审稿时长
69 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书