Premium
A Hybrid Liver‐Candidate Transportation System to Improve Accessibility and Extend Organ Life in Liver Transplantation
Author(s) -
Ganesan Rajesh,
Hung WenChi,
Chen ChunHung,
Peng TzuYi,
Koizumi Naoru
Publication year - 2018
Publication title -
incose international symposium
Language(s) - English
Resource type - Journals
ISSN - 2334-5837
DOI - 10.1002/j.2334-5837.2018.00538.x
Subject(s) - organ procurement , united network for organ sharing , boundary (topology) , computer science , liver transplantation , matching (statistics) , organ transplantation , simulation , distributed computing , medicine , transplantation , surgery , mathematics , mathematical analysis , pathology
In the USA, access to liver transplant is determined by the geographical organ allocation boundaries. The current allocation system involves a three‐tier hierarchical boundary system consisting of Organ Procurement Organization (OPO), the United Network for Organ Sharing (UNOS), and the National (USA) boundary. The search for a matching candidate when a liver is available begins within OPOs and moves up to the UNOS and National levels. The boundary‐based allocation system results in several issues such as geographical disparity in access, long system waiting times, liver wastages, high post‐graft failure, and prioritization of less severe candidates that live close to a transplant center over more needy ones from farther away. The paper investigates the conflict between attempts that reduce geographical disparity and those that optimize organ life (results in geographical disparity) through the application of Modeling and Simulation (M&S) to System Engineering. To resolve the above conflict, the paper presents the system architecture of a new hybrid liver‐candidate transport system instead of a liver‐only transport system, and uses discrete event simulation to model and validate the new system.