Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computational Science and Its Applications – ICCSA 2014 (ICCSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8580))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, D., Blum, A., Sandholm, T.: Clearing algorithms for Barter exchange markets: Enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce, June 13-16, pp. 295–304 (2007)

    Google Scholar 

  2. Alvelos, F., de Sousa, A., Santos, D.: Combining Column Generation and Metaheuristics. In: Talbi, E.-G. (ed.) Hybrid Metaheuristics. SCI, vol. 434, pp. 285–334. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Ashlagi, I., Gilchrist, D., Roth, A., Rees, M.: Nonsimultaneous chains and dominos in kidney paired donation - revisited. American Journal of Transplantation 11(5), 984–994 (2011)

    Article  Google Scholar 

  4. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.: Branch-and-price: column generation for solving huge integer programs. Operations Research 46, 316–329 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. BBC: BBC news website. six-way kidney transplant first (9/04/2008) (2008), http://news.bbc.co.uk/1/health/7338437.stm (last accessed in December 2012)

  6. Biro, P., Manlove, D., Rizzi, R.: Maximum weight cycle packing in directed graphs, wiht application to kidney exchange programs. Discrete Mathematics, Algorithms and Applications 1(4), 499–517 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Constantino, M., Klimentova, X., Viana, A., Rais, A.: New insights on integer-programming models for the kidney exchange problem. European Journal of Operational Research 231(1), 57–68 (2013)

    Article  MathSciNet  Google Scholar 

  8. Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  9. Dickerson, J., Procaccia, A., Sandholm, T.: Optimizing kidney exchange with transplant chains: Theory and reality. In: AAMAS 2012: Proc. 11th Intl. Joint Conference on Autonomous Agents and Multiagent Systems (June 2011)

    Google Scholar 

  10. Dickerson, J., Procaccia, A., Sandholm, T.: Failure-aware kidney exchange. In: EC 2013: Proc. 14th ACM Conference on Electronic Commerce (June 2013)

    Google Scholar 

  11. Floyd, R.: Algorithm 97: Shortest path. Communications of the ACM 5(6), 345 (1962)

    Article  Google Scholar 

  12. Gentry, S., Montgomery, R., Segev, D.: Kidney paired donation: Fundamentals, limitations, and expansions. American Journal of Kidney Disease 57(1), 144–151 (2010)

    Article  Google Scholar 

  13. Gentry, S., Montgomery, R., Swihart, B., Segev, D.: The roles of dominos and nonsimultaneous chains in kidney paired donation. American Journal of Transplantation 9, 1330–1336 (2009)

    Article  Google Scholar 

  14. Geoffrion, A.: Lagrangean relaxation for integer programming. Mathematical Programming Study 2, 82–114 (1974)

    Article  MathSciNet  Google Scholar 

  15. Glorie, K., Wagelmans, A., van de Klundert, J.: Iterative branch-and-price for large multi-criteria kidney exchange. Econometric Institute report (2012-11) (2012)

    Google Scholar 

  16. Hansen, P., Mladenovic, N., Perez, J.: Variable neighbourhood search: methods and applications. Annals of Operations Research 175, 367–407 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  17. Huang, C.: Circular stable matching and 3-way kidney transplant. Algorithmica 58, 137–150 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  18. de Klerk, M., Keizer, K., Claas, F., Haase-Kromwijk, B., Weimar, W.: The Dutch national living donor kidney exchange program. American Journal of Transplantation 5, 2302–2305 (2005)

    Article  Google Scholar 

  19. Manlove, D.F., O’Malley, G.: Paired and altruistic kidney donation in the UK: Algorithms and experimentation. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 271–282. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Montgomery, R., Gentry, S., Marks, W., Warren, D., Hiller, J., Houp, J., Zachary, A., Melancon, J., Maley, W., Simpkins, H.R.C., Segev, D.: Domino paired kidney donation: a strategy to make best use of live non-directed donation. The Lancet 368(9533), 419–421 (2006)

    Article  Google Scholar 

  21. Nemhauser, G., Wolsey, L.: Integer and Combinatiorial Optimization. A Wiley-Interscience Publication (1999)

    Google Scholar 

  22. Pedroso, J.: Maximizing expectation on vertex-disjoint cycle packing. Technical Report DCC-2013-5 (2013)

    Google Scholar 

  23. Rees, M., Kopke, J., Pelletier, R., Segev, D., Rutter, M., Fabrega, A., Rogers, J., Pankewycz, O., Hiller, J., Roth, A., Sandholm, T., Ünver, M., Montgomery, R.: A nonsimultaneous, extended, altruistic-donor chain. The New England Journal of Medicine 360, 1096–1101 (2009)

    Article  Google Scholar 

  24. Roth, A., Sönmez, T., Ünver, M.: Kidney exchange. Quarterly Journal of Economics 119(2), 457–488 (2004)

    Article  MATH  Google Scholar 

  25. Roth, A., Sönmez, T., Ünver, M.: Efficient kidney exchange: Coincidence of wants in markets with compatibility-based preferences. The American Economic Review 97(3), 828–851 (2007)

    Article  Google Scholar 

  26. Saidman, S., Roth, A., Sönmez, T., Ünver, M., Delmonico, F.: Increasing the opportunity of live kidney donation by matching for two- and three-way exchanges. Transplantation 81, 773–782 (2006)

    Article  Google Scholar 

  27. Segev, D., Gentry, S., Warren, D., Reeb, B., Montgomery, R.: Kidney paired donation and optimizing the use of live donor organs. The Journal of the American Medical Association 293(15), 1883–1890 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INESC TEC, Campus da FEUP, Rua Dr. Roberto Frias, 378, 4200-465, Porto, Portugal

    Xenia Klimentova & Ana Viana

  2. Centro Algoritmi / Departamento de Produção e Sistemas, Universidade do Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Filipe Alvelos

  3. ISEP - School of Engineering, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 431, 4200-072, Porto, Portugal

    Ana Viana

Authors
  1. Xenia Klimentova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Filipe Alvelos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ana Viana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, University of Basilicata, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Computer and Information Sciences, Covenant University, Ota, Nigeria

    Sanjay Misra

  3. Department of Production and Systems, University of Minho, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  4. DICAR, Polytecnico di Bari, 70125, Bari, Italy

    Carmelo Torre

  5. University of Minho, Braga, Portugal

    Jorge Gustavo Rocha  & Maria Irene Falcão  & 

  6. Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Klimentova, X., Alvelos, F., Viana, A. (2014). A New Branch-and-Price Approach for the Kidney Exchange Problem. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09129-7_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09128-0

  • Online ISBN: 978-3-319-09129-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation