Medicine Distribution Problem Between Pharmacy Warehouse and Pharmacies

dc.authorid Kose, Erkan/0000-0002-0097-4302
dc.authorid vural, danışment/0000-0003-4028-3810
dc.authorscopusid 56018098300
dc.authorscopusid 57868921100
dc.authorscopusid 57868756300
dc.authorscopusid 57205658680
dc.authorwosid Kose, Erkan/AAD-5978-2021
dc.authorwosid vural, danışment/AFR-8820-2022
dc.contributor.author Kose, Erkan
dc.contributor.author Duzenli, Berkay
dc.contributor.author Cakmak, Saliha
dc.contributor.author Vural, Danisment
dc.contributor.other Industrial Engineering
dc.date.accessioned 2024-07-05T15:24:25Z
dc.date.available 2024-07-05T15:24:25Z
dc.date.issued 2022
dc.department Atılım University en_US
dc.department-temp [Kose, Erkan; Duzenli, Berkay; Cakmak, Saliha] Nuh Naci Yazgan Univ, Kayseri, Turkey; [Vural, Danisment] Atilim Univ, Ankara, Turkey en_US
dc.description Kose, Erkan/0000-0002-0097-4302; vural, danışment/0000-0003-4028-3810 en_US
dc.description.abstract The pharmaceutical supply chain consists of supplier, distributor (pharmaceutical warehouses) and retail (pharmacists) stages. Since the costs of some pharmaceuticals are high while their shelf life is short, it is not possible for pharmacies to keep all kinds of drugs in their stocks. Instead, pharmacies maintain reasonable amounts of inventory for products with high demand, while fulfilling orders for those with low demand through pharmaceutical warehouses. In this study, the real life drug distribution problem of a pharmacy warehouse that meets demands of 186 pharmacies in 9 regions is addressed. Optimal distribution routes that minimize both the transportation time and the costs are obtained by using our two-stage optimization approach without changing the company's infrastructure. At first, the multiple traveling salesman method, which is an extension of the traveling salesman problem, is used to determine the optimal routes. In the second stage, the system is simulated to determine the most suitable travel frequencies and the savings in the number of vehicles used. The results show that, savings of 52% in vehicles used and 46% in distance traveled per day can be obtained if the developed model is applied. en_US
dc.identifier.citationcount 2
dc.identifier.doi 10.1007/s12046-022-01938-8
dc.identifier.issn 0256-2499
dc.identifier.issn 0973-7677
dc.identifier.issue 3 en_US
dc.identifier.scopus 2-s2.0-85137040142
dc.identifier.uri https://doi.org/10.1007/s12046-022-01938-8
dc.identifier.uri https://hdl.handle.net/20.500.14411/2431
dc.identifier.volume 47 en_US
dc.identifier.wos WOS:000843134700001
dc.identifier.wosquality Q3
dc.institutionauthor Vural, Danışment
dc.language.iso en en_US
dc.publisher Springer india en_US
dc.relation.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.scopus.citedbyCount 4
dc.subject Multiple traveling salesman problem en_US
dc.subject system simulation en_US
dc.subject supply chain en_US
dc.subject pharmacy en_US
dc.title Medicine Distribution Problem Between Pharmacy Warehouse and Pharmacies en_US
dc.type Article en_US
dc.wos.citedbyCount 2
dspace.entity.type Publication
relation.isAuthorOfPublication 8b5d83f7-7fa7-4fd9-a071-49496b6c83d3
relation.isAuthorOfPublication.latestForDiscovery 8b5d83f7-7fa7-4fd9-a071-49496b6c83d3
relation.isOrgUnitOfPublication 12c9377e-b7fe-4600-8326-f3613a05653d
relation.isOrgUnitOfPublication.latestForDiscovery 12c9377e-b7fe-4600-8326-f3613a05653d

Files

Collections