Distance restricted maximal covering model for pharmacy duty scheduling problem
DOI:
https://doi.org/10.11121/ijocta.01.2018.00557Keywords:
Pharmacy, duty scheduling, location models, maximal coveringAbstract
Pharmacies 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.Downloads
References
Church, R., & ReVelle, C. (1974). Maximal covering location problem. Papers of the Regional Science Association. 32, 101-118.
Kocatürk, F., & Özpeynirci, Ö. (2014). Variable neighborhood search for the pharmacy duty scheduling problem. Computers & Operations Research. 51, 218-226.
Kocatürk, F., & Ağlamaz, E. (2016). Pharmacy duty scheduling problem. International Transactions in Operational Research. 23, 459-480.
Özceylan, E., Uslu, A., Erbaş, M., Çetinkaya, C., & İşleyen, S.K. (2017). Optimizing the location-allocation problem of pharmacy warehouses: A case study in Gaziantep. An International Journal of Optimization and Control: Theories & Applications. 7(1), 117-129.
Farahani, R.Z., SteadieSeifi, M. & Asgari, N. (2010). Multiple criteria facility location problems: A survey. Applied Mathematical Modelling. 34, 1689–1709.
Daskin, M. S., & Dean, L. K. (2004). Location of Health Care Facilities. Chapter 3 in the Handbook of OR/MS in Health Care: A Handbook of Methods and Applications. Kluwer.
ReVelle, C.S., Eiselt, H.A., & Daskin, M.S. (2008). A bibliography for some fundamental problem categories in discrete location science. European Journal of Operational Research, 184, 817–848.
Karasakal, O., & Karasakal, E.K. (2004). A maximal covering location model in the presence of partial coverage. Computers & Operations Research, 31, 1515-1526.
Zarandi, M.H.F., Davari, S., & Sisakht, S.A.H. (2013). The large-scale dynamic maximal covering location problem. Mathematical and Computer Modelling, 57, 710-719.
Yin, P., & Mu, L., (2012). Modular capacitated maximal covering location problem for the optimal siting of emergency vehicles. Applied Geography, 34, 247-254.
Zarandi ,M.H.F., Davari, S., & Sisakht, S.A.H. (2011). The large scale maximal covering location problem. Scientia Iranica, 18(6), 1564-1570.
Davari, S., Zarandi ,M.H.F., & Turksen, I.B. (2013). A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii. Knowledge-Based Systems, 41, 68-76.
Paul, N.R., Lunday, B.J., & Nurre, S.G. (2017). A multiobjective, maximal conditional covering location problem applied to the relocation of hierarchical emergency response facilities. Omega, 66, 147-158.
Diaz, J.A., Luna, D.E, Vallejo, J-F.C., & Ramirez, M-S.C. (2017). GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Systems with Applications, 82, 62-76.
Downloads
Published
How to Cite
Issue
Section
License
Articles published in IJOCTA are made freely available online immediately upon publication, without subscription barriers to access. All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (click here to read the full-text legal code). This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.
Under the Creative Commons Attribution 4.0 International License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited.
The readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material
- for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
under the following terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
This work is licensed under a Creative Commons Attribution 4.0 International License.
