Document Type : original-application paper

Authors

1 Department of Industrial Engineering, Bonab Branch, Islamic Azad University, Bonab, Iran.

2 Department of Electrical Engineering, Bonab Branch, Islamic Azad University, Bonab, Iran.

Abstract

Purpose: One of the most vital subcategories of the health care system is organ transplantation, and since organ transplant centers deal directly with surgical operations and, as a result, human lives, the importance of this issue has received more attention. One of the major differences between the organ transplant supply chain and other supply chains is the possibility of corruption of related products. Therefore, the time and also the location of organ transplant centers are of special importance. On the other hand, due to the rapid growth of the demand for organ transplantation and the lack of resources, the patient's waiting time to complete the transplantation process plays a vital role in the organ transplantation system.
Methodology: This study presents a robust bi-objective mathematical model for the location problem of allocating organ transplant centers under uncertainty, which includes the total costs of the organ transplant system as well as the average patient waiting time for organ transplantation, which follows a G/G/m queuing system.
Findings: To solve this model, the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) has been used. Finally, the applicability of this model and the efficiency of the mentioned algorithm compared to the defined indicators have been shown through numerical experiments.
Originality/Value: Since each organ can spend a certain amount of time outside the body and there is a possibility of corruption or a decrease in the quality of the transplant, the time between the organ leaving the body and the completion of the transplant operation plays an essential role in the transplant system.

Keywords

Main Subjects

[1]        Sorourkhah, A. (2022). Coping uncertainty in the supplier selection problem using a scenario-based approach and distance measure on type-2 intuitionistic fuzzy sets. Fuzzy optimization and modeling journal, 3(1), 64–71. DOI:10.30495/fomj.2022.1953705.1066
[2]        Eydi, A., & Mansouri, Z. (2023). The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns. Journal of industrial and management optimization, 19(10), 7423–7446. DOI:10.3934/jimo.2023003
[3]        Karasakal, O., Karasakal, E., & Töreyen, Ö. (2023). A partial coverage hierarchical location allocation model for health services. European journal of industrial engineering, 17(1), 115–147. DOI:10.1504/EJIE.2023.10045477
[4]        Bruni, M. E., Conforti, D., Sicilia, N., & Trotta, S. (2006). A new organ transplantation location-allocation policy: a case study of Italy. Health care management science, 9(2), 125–142. DOI:10.1007/s10729-006-7661-z
[5]        Kong, N., Schaefer, A. J., Hunsaker, B., & Roberts, M. S. (2010). Maximizing the efficiency of the U.S. liver allocation system through region design. Management science, 56(12), 2111–2122. DOI:10.1287/mnsc.1100.1249
[6]        Demirci, M. C., Schaefer, A. J., Edwin Romeijn, H., & Roberts, M. S. (2012). An exact method for balancing efficiency and equity in the liver allocation hierarchy. INFORMS journal on computing, 24(2), 260–275. DOI:10.1287/ijoc.1110.0445
[7]        Beliën, J., De Boeck, L., Colpaert, J., Devesse, S., & Van Den Bossche, F. (2013). Optimizing the facility location design of organ transplant centers. Decision support systems, 54(4), 1568–1579. DOI:10.1016/j.dss.2012.05.059
[8]        Zahiri, B., Tavakkoli-Moghaddam, R., & Pishvaee, M. S. (2014). A robust possibilistic programming approach to multi-period location-allocation of organ transplant centers under uncertainty. Computers and industrial engineering, 74(1), 139–148. DOI:10.1016/j.cie.2014.05.008
[9]        Zahiri, B., Tavakkoli-Moghaddam, R., Mohammadi, M., & Jula, P. (2014). Multi objective design of an organ transplant network under uncertainty. Transportation research part E: logistics and transportation review, 72, 101–124. DOI:10.1016/j.tre.2014.09.007
[10]      Mantecchini, L., Paganelli, F., Morabito, V., Ricci, A., Peritore, D., Trapani, S., ... & Costa, A. N. (2016). Transportation of organs by air: safety, quality, and sustainability criteria. Transplantation proceedings (Vol. 48, No. 2, pp. 304-308). Elsevier. DOI: 10.1016/j.transproceed.2015.12.050
[11]      Cacchiani, V., Malandri, C., Mantecchini, L., & Paganelli, F. (2018). A study on the optimal aircraft location for human organ transportation activities. Transportation research procedia, 30, 314–323. DOI:10.1016/j.trpro.2018.09.034
[12]      Savaşer, S., Kınay, Ö. B., Kara, B. Y., & Cay, P. (2019). Organ transplantation logistics: a case for Turkey. OR spectrum, 41(2), 327–356. DOI:10.1007/s00291-018-0538-y
[13]      Klein, A. S., Messersmith, E. E., Ratner, L. E., Kochik, R., Baliga, P. K., & Ojo, A. O. (2010). Organ donation and utilization in the United States, 1999-2008: special feature. American journal of transplantation, 10(4 PART 2), 973–986. DOI:10.1111/j.1600-6143.2009.03008.x
[14]      Oztekin, A., Kong, Z. J., & Delen, D. (2011). Development of a structural equation modeling-based decision tree methodology for the analysis of lung transplantations. Decision support systems, 51(1), 155–166. DOI:10.1016/j.dss.2010.12.004
[15]      Lunz, J., Hinsdale, L., King, C., Pastush, R., Buenvenida, M., & Harmon, M. (2017). The coordination of allocation: logistics of kidney organ allocation to highly sensitized patients. Human immunology, 78(1), 16–18. DOI:10.1016/j.humimm.2016.10.002
[16]      Caruso, V., & Daniele, P. (2018). A network model for minimizing the total organ transplant costs. European journal of operational research, 266(2), 652–662. DOI:10.1016/j.ejor.2017.09.040
[17]      Goli, A., Ala, A., & Mirjalili, S. (2023). A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty. Annals of operations research, 328(1), 493–530. DOI:10.1007/s10479-022-04829-7