IP solutions for international kidney exchange programmes

  • PDF / 1,329,199 Bytes
  • 21 Pages / 439.37 x 666.142 pts Page_size
  • 32 Downloads / 213 Views

DOWNLOAD

REPORT


IP solutions for international kidney exchange programmes Radu-Stefan Mincu1 Utkarsh Verma4

· Péter Biró2,3 · Márton Gyetvai2,3 · Alexandru Popa1 ·

© The Author(s) 2020

Abstract In kidney exchange programmes patients with end-stage renal failure may exchange their willing, but incompatible living donors among each other. National kidney exchange programmes are in operation in ten European countries, and some of them have already conducted international exchanges through regulated collaborations. The exchanges are selected by conducting regular matching runs (typically every three months) according to well-defined constraints and optimisation criteria, which may differ across countries. In this work we give integer programming formulations for solving international kidney exchange problems, where the optimisation goals and constraints may be different in the participating countries and various feasibility criteria may apply for the international cycles and chains. We also conduct simulations showing the long-run effects of international collaborations for different pools and under various national restrictions and objectives. We compute the expected gains of the cooperation between two countries with different pool sizes and different restrictions on the cycle-length. For instance, if country A allows 3-way cycles and country B allows 2-way cycles only, whilst the pool size of country A is four times larger than the pool size of country B (which is a realistic case for the relation of Spain and France, respectively), then the increase in the number of transplants will be about 2% for country A and about 37% for country B. Keywords Integer programming · Kidney exchanges · Computational simulation

P. Biró: Supported by the Hungarian Academy of Sciences under its Momentum Programme (LP2016-3/2018) and Cooperation of Excellences Grant (KEP-6/2018), and by the Hungarian Scientific Research Fund – OTKA (No. K129086).

B B

Radu-Stefan Mincu [email protected] Péter Biró [email protected]

Extended author information available on the last page of the article

123

P. Biró et al.

1 Introduction When an end-stage kidney patient has a willing, but incompatible living donor, then in many countries this patient can exchange his/her donor for a compatible one in a so-called kidney exchange programme (KEP). The first national kidney exchange programme was established in 2004 in the Netherlands in Europe (De Klerk et al. 2005). Currently there are ten countries with operating programmes in Europe (Biró et al. 2018), the largest being the UK programme (Manlove and O’Malley 2014). Typically the matching runs are conducted every three months on pools with around 50–300 patient-donor pairs. The so-called virtual compatibility graph represents the patient-donor pairs with nodes and an arc represents a possible donation between the corresponding donor and patient, that is found compatible in a virtual crossmatch test. The exchange cycles are selected by well-defined optimisation rules, that can vary across countries.