KPDGUI

KPDGUI optimizes kidney paired donation (KPD) exchange solutions to maximize successful transplants by identifying and arranging exchanges among incompatible donor–candidate pairs, including non-directed or altruistic donors.

Key Features:

• Optimization algorithms: Employs advanced computer algorithms to identify optimal exchange solutions within KPD pools.
• Novel optimization criteria: Incorporates optimization criteria specifically designed to handle uncertainties related to transplant viability.
• Contingency planning: Generates contingency plans and fallback exchange options for scenarios in which planned exchanges may not proceed.
• Multiple optimization schemes: Produces solutions under different algorithmic priorities and optimization schemes.
• KPD-specific modeling: Models exchanges among incompatible donor–candidate pairs, including non-directed or altruistic donors, to maximize numbers of successful transplants.
• Empirical evaluation: Demonstrated on a case study using real data from an existing paired donation program.

Scientific Applications:

• Maximizing transplant yield: Optimizes selection of exchange sets to increase the number of successful kidney transplants in KPD programs.
• Managing uncertainty: Produces exchange plans and contingency strategies that account for uncertainty in transplant viability.
• Inclusive exchange design: Enables inclusion of non-directed or altruistic donors in match runs and exchange planning.
• Comparative solution assessment: Allows comparison of solutions derived under different algorithmic priorities and optimization schemes.
• Real-data evaluation: Supports testing and assessment using datasets from existing paired donation programs.

Methodology:

Uses advanced computer optimization algorithms with novel objective criteria to model KPD exchange problems, account for transplant viability uncertainty, and generate contingency (fallback) exchange plans across multiple optimization schemes.