IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v272y2019i1d10.1007_s10479-017-2647-4.html
   My bibliography  Save this article

Maximizing the expected number of transplants in kidney exchange programs with branch-and-price

Author

Listed:
  • Filipe Alvelos

    (Universidade do Minho)

  • Xenia Klimentova

    (INESC TEC, Campus da FEUP)

  • Ana Viana

    (INESC TEC, Campus da FEUP
    Polytechnic of Porto)

Abstract

In this paper, we propose a branch-and-price approach for solving the problem of maximizing the expected number of transplants in Kidney Exchange Programs (KEPs). In these programs, the decision on which transplants will be conducted is usually made with the support of optimization models with the assumption that all operations will take place. However, after a plan of transplants is defined, a pair may leave the KEP or a more accurate compatibility evaluation exam may invalidate a transplant. To model these possible events we consider probabilities of failure of vertices and of arcs and the objective of maximizing the expected number of transplants. The proposed approach is based on the so-called cycle formulation, where decision variables are associated with cycles. Built on the concept of type of cycle a branch-and-price algorithm is conceived. One subproblem is defined for each type of cycle. We present computational results of the proposed branch-and-price algorithm and compare them with solving directly the cycle formulation (with a general purpose mixed integer programming solver—CPLEX) showing that the proposed approach is the only one suitable for larger instances.

Suggested Citation

  • Filipe Alvelos & Xenia Klimentova & Ana Viana, 2019. "Maximizing the expected number of transplants in kidney exchange programs with branch-and-price," Annals of Operations Research, Springer, vol. 272(1), pages 429-444, January.
    • Handle: RePEc:spr:annopr:v:272:y:2019:i:1:d:10.1007_s10479-017-2647-4
    DOI: 10.1007/s10479-017-2647-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2647-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-017-2647-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kristiaan M. Glorie & J. Joris van de Klundert & Albert P. M. Wagelmans, 2014. "Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 498-512, October.
    2. Constantino, Miguel & Klimentova, Xenia & Viana, Ana & Rais, Abdur, 2013. "New insights on integer-programming models for the kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 57-68.
    3. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    4. Vicky Mak-Hau, 2017. "On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 35-59, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Klimentova, Xenia & Viana, Ana & Pedroso, João Pedro & Santos, Nicolau, 2021. "Fairness models for multi-agent kidney exchange programmes," Omega, Elsevier, vol. 102(C).
    2. Glorie, K.M. & Wagelmans, A.P.M. & van de Klundert, J.J., 2012. "Iterative branch-and-price for hierarchical multi-criteria kidney exchange," Econometric Institute Research Papers EI 2012-11, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    4. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
    5. Julien Combe & Victor Hiller & Olivier Tercieux & Benoît Audry & Jules Baudet & Géraldine Malaquin & François Kerbaul & Corinne Antoine & Marie-Alice Macher & Christian Jacquelinet & Olivier Bastien &, 2022. "Perspectives for future development of the kidney paired donation programme in France [Perspectives pour une évolution du programme de don croisé de reins en France]," Post-Print hal-03843902, HAL.
    6. Nicolau Santos & Paolo Tubertini & Ana Viana & João Pedro Pedroso, 2017. "Kidney exchange simulation and optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1521-1532, December.
    7. Kristiaan M. Glorie & J. Joris van de Klundert & Albert P. M. Wagelmans, 2014. "Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 498-512, October.
    8. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    9. John P. Dickerson & Ariel D. Procaccia & Tuomas Sandholm, 2019. "Failure-Aware Kidney Exchange," Management Science, INFORMS, vol. 65(4), pages 1768-1791, April.
    10. Biró, Péter & van de Klundert, Joris & Manlove, David & Pettersson, William & Andersson, Tommy & Burnapp, Lisa & Chromy, Pavel & Delgado, Pablo & Dworczak, Piotr & Haase, Bernadette & Hemke, Aline & J, 2021. "Modelling and optimisation in European Kidney Exchange Programmes," European Journal of Operational Research, Elsevier, vol. 291(2), pages 447-456.
    11. Mehdi Zeynivand & Mehdi Najafi & Mohammad Modarres Yazdi, 2023. "A Recourse Policy to Improve Number of Successful Transplants in Uncertain Kidney Exchange Programs," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 476-507, May.
    12. Vicky Mak-Hau, 2017. "On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 35-59, January.
    13. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    14. Hoogervorst, R. & Dollevoet, T.A.B. & Maróti, G. & Huisman, D., 2018. "Reducing Passenger Delays by Rolling Stock Rescheduling," Econometric Institute Research Papers EI2018-29, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Lentink, R.M. & Fioole, P-J. & Kroon, L.G. & van 't Woudt, C., 2003. "Applying Operations Research techniques to planning of train shunting," ERIM Report Series Research in Management ERS-2003-094-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    17. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    18. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    19. Andreas Ernst & Houyuan Jiang & Mohan Krishnamoorthy, 2006. "Exact Solutions to Task Allocation Problems," Management Science, INFORMS, vol. 52(10), pages 1634-1646, October.
    20. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:272:y:2019:i:1:d:10.1007_s10479-017-2647-4. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.