Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design
AbstractCadaveric liver transplantation is the only viable therapy for end-stage liver disease patients without a living donor. However, this type of transplantation is hindered in the United States by donor scarcity and rapid viability decay. Given these difficulties, the current U.S. liver allocation policy balances allocation likelihood and geographic proximity by allocating cadaveric livers hierarchically. We consider the problem of maximizing the efficiency of intraregional transplants through the redesign of liver allocation regions. We formulate the problem as a set partitioning problem that clusters organ procurement organizations into regions. We develop an estimate of viability-adjusted intraregional transplants to capture the trade-off between large and small regions. We utilize branch and price because the set partitioning formulation includes too many potential regions to handle explicitly. We formulate the pricing problem as a mixed-integer program and design a geographic-decomposition heuristic to generate promising columns quickly. Because the optimal solution depends on the design of geographic decomposition, we develop an iterative procedure that integrates branch and price with local search to alleviate this dependency. Finally, we present computational studies that show the benefit of region redesign and the efficacy of our solution approach. Our carefully calibrated test instances can be solved within a reasonable amount of time, and the resulting region designs yield a noticeable improvement over the current configuration.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 56 (2010)
Issue (Month): 12 (December)
set partitioning; branch and price; column generation; clustering; organ allocation;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.