A New Branch-and-Price Approach for the Kidney Exchange Problem

The kidney exchange problem (KEP) is an optimization problem arising in the framework of transplant programs that allow exchange of kidneys between two or more incompatible patient-donor pairs. In this paper an approach based on a new decomposition model and branch-and-price is proposed to solve large KEP instances. The optimization problem considers, hierarchically, the maximization of the number of transplants and the minimization of the size of exchange cycles. Computational comparison of different variants of branch-and-price for the standard and the proposed objective functions are presented. The results show the efficiency of the proposed approach for solving large instances.

[1]  David Manlove,et al.  Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs , 2009, Discret. Math. Algorithms Appl..

[2]  Chien-Chung Huang.  Circular Stable Matching and 3-way Kidney Transplant , 2009, Algorithmica.

[3]  D. Segev,et al.  Kidney paired donation and optimizing the use of live donor organs. , 2005, JAMA.

[4]  Robert A Montgomery,et al.  Kidney paired donation: fundamentals, limitations, and expansions. , 2011, American journal of kidney diseases : the official journal of the National Kidney Foundation.

[5]  D. Segev,et al.  The Roles of Dominos and Nonsimultaneous Chains in Kidney Paired Donation , 2009, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[6]  A. Roth,et al.  Nonsimultaneous Chains and Dominos in Kidney‐ Paired Donation—Revisited , 2011, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[7]  Avrim Blum,et al.  Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.

[8]  F. Claas,et al.  The Dutch National Living Donor Kidney Exchange Program , 2005, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[9]  Ariel D. Procaccia,et al.  Failure-aware kidney exchange , 2013, EC '13.

[10]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

[11]  D. Segev,et al.  Domino paired kidney donation: a strategy to make best use of live non-directed donation , 2006, The Lancet.

[12]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[13]  João Pedro Pedroso.  Maximizing Expectation on Vertex-Disjoint Cycle Packing , 2014, ICCSA.

[14]  Amaro de Sousa,et al.  Combining Column Generation and Metaheuristics , 2013, Hybrid Metaheuristics.

[15]  J. Klundert,et al.  Iterative branch-and-price for large multi-criteria kidney exchange , 2013 .

[16]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[17]  M. Utku Ünver,et al.  A nonsimultaneous, extended, altruistic-donor chain. , 2009, The New England journal of medicine.

[18]  Albert P. M. Wagelmans,et al.  Iterative branch-and-price for hierarchical multi-criteria kidney exchange , 2012 .

[19]  Miguel Constantino,et al.  New insights on integer-programming models for the kidney exchange problem , 2013, Eur. J. Oper. Res..

[20]  David Manlove,et al.  Paired and Altruistic Kidney Donation in the UK , 2015, ACM J. Exp. Algorithmics.

[21]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[22]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[23]  M. Utku Ünver,et al.  Increasing the Opportunity of Live Kidney Donation by Matching for Two- and Three-Way Exchanges , 2006, Transplantation.

[24]  Ariel D. Procaccia,et al.  Optimizing kidney exchange with transplant chains: theory and reality , 2012, AAMAS.

[25]  M. Utku Ünver,et al.  Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .