A Discrete Optimization Model to Minimize Organ Recovery Time Using Heuristic Algorithms
DOI:
https://doi.org/10.37266/ISER.2013v1i1.pp75-82Abstract
This study proposes a discrete optimization model to minimize the organ recovery time in an Organ Procurement Organization (OPO) by grouping its associated hospitals and transplant centers into several clusters, based on their available organ recovery groups. Typically, the OPO covers a relatively large geographical area to recover organs from donors and deliver them to the recipients. Organs and/or tissues need to be transplanted within their viable time. Therefore, a discrete optimization model is proposed, based on the -median approach to identify optimal locations of the organ recovery groups to recover the organs within a desired time interval. Three heuristic solution approaches, such as Multi-start Fast Interchange (MFI), Simulated Annealing (SA), and Lagrangian Relaxation Algorithm (LRA), are applied to solve the -median clustering problems. Numerical examples are tested to identify a better solution approach in terms of a set of key performance indicators, such as elapse time, Silhouette index, and objective function value. The experimental results indicate that the MFI approach is effective finding an initial solution in the shortest possible time. To find a non-dominant optimal solution, the LRA outperformed the initial solution. In the future, the experimental results will be compared with real data to ensure the effectiveness of the proposed model.References
Alba, E., & Domínguez, E. (2006). Comparative analysis of modern optimization tools for the p-median problem. Statistics and Computing, 16(3), 251-260.
Beltran, C., Tadonki, C., & Vial, J. (2006). Solving the p-median problem with a semi-lagrangian relaxation. Computational Optimization and Applications, 35(2), 239-260.
Briant, O., & Naddef, D. (2004). The optimal diversity management problem. Operations Research, 52(1), 515-526.
Brusco, M.J., &Köhn, H.-F. (2009). Exemplar-based clustering via simulated annealing. Psychometrika, 74(3), 457-475.
Center for Organ Recovery and Education (CORE). (2013, January). Facts and statistics. Retrieved from: http://www.core.org
Hansen, P., &Mladenoviĉ, N. (1997). Variable neighborhood search for the p-median. Location Science, 5(4), 207-226.
Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79(1-3), 191-215.
Kariv, O., & Hakimi, L. (1979). An algorithmic approach to network location problems part II: The p-medians. SIAM Journal of Applied Mathematics, 37(1), 539-560.
Kaufman, L., & Rousseeuw, P.J. (1990). Finding groups in data: An introduction to cluster analysis. New York: Wiley.
Kong, N. (2005). Optimizing the efficiency of the United States organ allocation system through region reorganization (Doctoral Dissertation, University of Pittsburg). Retrieved from: http://www.ie.pitt.edu/~schaefer/Papers/KongDissertation.pdf
Meier-Kriesche, H.U., Port, F.K., Ojo, A.O., Rudich, S.M., Hanson, J.A., Cibrik, D.M., Leichtman, A.B., & Kaplan, B. (2000). Effect of waiting time on renal transplant outcome. Kidney International, 58(3), 1311-1317.
Mladenoviĉ, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J.A. (2007). The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179(3), 927-939.
Mulvey, J.M., & Crowder, H.P. (1979). Cluster analysis: An application of lagrangean relaxation. Management Science, 25(4), 329-340.
New York Organ Donor Network. (2013, January). Organ donation facts. Retrieved from: http://www.donatelifeny.org/about-donation/quick-facts-about-donation
Rais, A., & Viana, A. (2010). Operations research in healthcare: A survey. International Transitions in Operation Research, 18(1), 1-31.
Reese, J. (2006). Solution methods for the p-median problem: An annotated bibliography. Networks, 48(3), 125-142.
Saha, C., Zhang, J., Yoon, S.W., Khasawneh, M.T., & Krishnaswami, S. (2012, May). Selection and matching of kidney donor and recipient using fuzzy techniques and analytic hierarchy process. Paper presented at the Proceedings of the Industrial and Systems Engineering Research Conference, Orlando, Florida.
U.S. Department of Health and Human Services. (2013, January). Organ procurement and transportation network. Retrieved from: http://optn.transplant.hrsa.gov/members/regions.asp
Whitaker, R. (1983). A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR, 21(2), 95-108.
Wolfe, R.A., Ashby, V.B., Milford, E.L., Ojo, A.O., Ettenger, R.E., Agodoa, L.Y., Held, P.J., & Port, F.K. (1999). Comparison of Mortality in all Patients on Dialysis, Patients on Dialysis Awaiting Transplantation and Recipients of a First Cadaveric Transplant. The New England Journal of Medicine, 341(23), 1725-1730.
Published
How to Cite
Issue
Section
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
The copyediting stage is intended to improve the flow, clarity, grammar, wording, and formatting of the article. It represents the last chance for the author to make any substantial changes to the text because the next stage is restricted to typos and formatting corrections. The file to be copyedited is in Word or .rtf format and therefore can easily be edited as a word processing document. The set of instructions displayed here proposes two approaches to copyediting. One is based on Microsoft Word's Track Changes feature and requires that the copy editor, editor, and author have access to this program. A second system, which is software independent, has been borrowed, with permission, from the Harvard Educational Review. The journal editor is in a position to modify these instructions, so suggestions can be made to improve the process for this journal.
