The storage location assignment problem of automated drug dispensing machines

Mengge Yuan; Ning Zhao; Kan Wu; Zhibin Chen

doi:10.1016/j.cie.2023.109578

The storage location assignment problem of automated drug dispensing machines

Mengge Yuan, Ning Zhao^*, Kan Wu, Zhibin Chen

^*Corresponding author for this work

Department of Industrial and Business Management

Kunming University of Science and Technology

Research output: Contribution to journal › Journal Article › peer-review

3 Scopus citations

Abstract

Drug storage is an important issue in the pharmacy. This paper studies the drug storage location assignment problem of automated drug dispensing machines to improve the space utilization and improve the efficiency of machines. Based on the demand for drugs in the pharmacy, the storage space occupied by various drugs in the automated drug dispensing machines is solved. To prevent the drugs in one prescription from being picked across machines, the drugs are grouped based on the Jaccard similarity coefficient. Finally, the assignment strategy based on the demand frequency of drugs is proposed. Numerical experiments verify the effectiveness of the proposed method. The results of this paper provide a theoretical basis for the drug storage location assignment of automated drug dispensing machines in smart pharmacies.

Original language	English
Article number	109578
Journal	Computers and Industrial Engineering
Volume	184
DOIs	https://doi.org/10.1016/j.cie.2023.109578
State	Published - 10 2023

Bibliographical note

Publisher Copyright:
© 2023 The Author(s)

Keywords

Automated Drug Dispensing Machine
Similarity Coefficient
Storage Location Assignment

Access to Document

10.1016/j.cie.2023.109578

Cite this

@article{827bf01dcb84429ca7d784f3bb5bce4c,

title = "The storage location assignment problem of automated drug dispensing machines",

abstract = "Drug storage is an important issue in the pharmacy. This paper studies the drug storage location assignment problem of automated drug dispensing machines to improve the space utilization and improve the efficiency of machines. Based on the demand for drugs in the pharmacy, the storage space occupied by various drugs in the automated drug dispensing machines is solved. To prevent the drugs in one prescription from being picked across machines, the drugs are grouped based on the Jaccard similarity coefficient. Finally, the assignment strategy based on the demand frequency of drugs is proposed. Numerical experiments verify the effectiveness of the proposed method. The results of this paper provide a theoretical basis for the drug storage location assignment of automated drug dispensing machines in smart pharmacies.",

keywords = "Automated Drug Dispensing Machine, Similarity Coefficient, Storage Location Assignment",

author = "Mengge Yuan and Ning Zhao and Kan Wu and Zhibin Chen",

note = "Publisher Copyright: {\textcopyright} 2023 The Author(s)",

year = "2023",

month = oct,

doi = "10.1016/j.cie.2023.109578",

language = "英语",

volume = "184",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - The storage location assignment problem of automated drug dispensing machines

AU - Yuan, Mengge

AU - Zhao, Ning

AU - Wu, Kan

AU - Chen, Zhibin

PY - 2023/10

Y1 - 2023/10

N2 - Drug storage is an important issue in the pharmacy. This paper studies the drug storage location assignment problem of automated drug dispensing machines to improve the space utilization and improve the efficiency of machines. Based on the demand for drugs in the pharmacy, the storage space occupied by various drugs in the automated drug dispensing machines is solved. To prevent the drugs in one prescription from being picked across machines, the drugs are grouped based on the Jaccard similarity coefficient. Finally, the assignment strategy based on the demand frequency of drugs is proposed. Numerical experiments verify the effectiveness of the proposed method. The results of this paper provide a theoretical basis for the drug storage location assignment of automated drug dispensing machines in smart pharmacies.

AB - Drug storage is an important issue in the pharmacy. This paper studies the drug storage location assignment problem of automated drug dispensing machines to improve the space utilization and improve the efficiency of machines. Based on the demand for drugs in the pharmacy, the storage space occupied by various drugs in the automated drug dispensing machines is solved. To prevent the drugs in one prescription from being picked across machines, the drugs are grouped based on the Jaccard similarity coefficient. Finally, the assignment strategy based on the demand frequency of drugs is proposed. Numerical experiments verify the effectiveness of the proposed method. The results of this paper provide a theoretical basis for the drug storage location assignment of automated drug dispensing machines in smart pharmacies.

KW - Automated Drug Dispensing Machine

KW - Similarity Coefficient

KW - Storage Location Assignment

UR - http://www.scopus.com/inward/record.url?scp=85170425005&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2023.109578

DO - 10.1016/j.cie.2023.109578

M3 - 文章

AN - SCOPUS:85170425005

SN - 0360-8352

VL - 184

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

M1 - 109578

ER -

The storage location assignment problem of automated drug dispensing machines

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this