Distance restricted maximal covering model for pharmacy duty scheduling problem

Basit Öğe Kaydı
dc.contributor.authorUncu, Nuşin
dc.contributor.authorBulğurcu, Berna
dc.contributor.authorKılıç, Fatih
dc.date.accessioned2025-01-06T17:30:12Z
dc.date.available2025-01-06T17:30:12Z
dc.date.issued2018
dc.description.abstractPharmacies are considered as an integral part of health care systems for supplying medicine to patients. In order to access medicine with ease, pharmacies locations in the context of distance and demand are important for patients. In the case of a few numbers of pharmacies may be on duty at nights or during holidays, pharmacies duty scheduling problem occur and can be associated with location models. In contrast to widely used p-median model which aims to minimize the demand-weighted distance, we maximize the demand covered over the distance between the patients and the pharmacies on duty. Main contribution of the proposed model is the restriction constraint for the distance between pharmacies on duty in order to ensure fairness in an organizational view of point. We propose a distance restricted maximal covering location model (DR-MCLM) in this study. This mathematical model is a mixed integer linear programming model and solved by Lingo optimization software. The distances between the pharmacies and the sites are obtained using Geographic Information Systems (GIS). The model is applied for the case in Adana, one of the biggest cities in Turkey. The results are given on the maps of the city, including the pharmacies on duty and their assignments to sites in each day of the period. © 2018 Balikesir University. All rights reserved.
dc.identifier.doi10.11121/ijocta.01.2018.00557
dc.identifier.endpage215
dc.identifier.issn2146-0957
dc.identifier.issue2
dc.identifier.scopus2-s2.0-85054101026
dc.identifier.scopusqualityQ2
dc.identifier.startpage208
dc.identifier.trdizinid314366
dc.identifier.urihttps://doi.org/10.11121/ijocta.01.2018.00557
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/314366
dc.identifier.urihttps://hdl.handle.net/20.500.14669/1519
dc.identifier.volume8
dc.indekslendigikaynakScopus
dc.indekslendigikaynakTR-Dizin
dc.language.isoen
dc.publisherBalikesir University
dc.relation.ispartofInternational Journal of Optimization and Control: Theories and Applications
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_20241211
dc.subjectDistance restricted
dc.subjectDuty scheduling
dc.subjectLocation models
dc.subjectMaximal covering
dc.subjectPharmacy
dc.titleDistance restricted maximal covering model for pharmacy duty scheduling problem
dc.typeArticle

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu