A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion

Amir Elalouf, Yael Perlman*, Uri Yechiali

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a novel approach, based on a Human Leukocyte Antigen (HLA) best-fit criterion, to dynamically allocate live organs (specifically, kidneys) to candidates needing transplantation. A ‘reward’ is assigned to each level of HLA fit, such that higher rewards are attributed to transplants between better-matched candidates and kidneys. We also envision future technologies by which it will be possible to store organs so that two queues may form: waiting candidates or stored kidneys. Consequently, a double-ended queue of candidates and kidneys is constructed, where the lifetime of a stored kidney is random, and candidates queueing for transplantation may die (‘renege’) while waiting. We derive expressions for the probability that a candidate gets a kidney before reneging; for the mean numbers of waiting candidates and of stored kidneys; and for a candidate's or kidney's mean sojourn time. Assuming a best-HLA-fit matching policy, we study three measures of effectiveness: (i) Rate of Reward from Transplantation (RRT); (ii) Expected Reward per Transplantation (ERT), calculated as RRT divided by the rate of performed transplantations, and (iii) Gained rate of reward per one dollar of expenditure. The optimal fraction of kidneys that should be stored so as to maximize the rate of reward per one dollar of expenditure is numerically determined.

Original languageEnglish
Pages (from-to)179-191
Number of pages13
JournalApplied Mathematical Modelling
Volume60
DOIs
StatePublished - Aug 2018

Keywords

  • Double-ended queue
  • Dynamic organ allocation
  • HLA best-fit
  • Organ preservation
  • Reneging

Fingerprint

Dive into the research topics of 'A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion'. Together they form a unique fingerprint.

Cite this