TY - GEN
T1 - A New Efficient Genetic Algorithm for Solving the Kidney Exchange Problem
AU - Ortega-Bedoya, Juan Felipe
AU - Otero-Villamarin, Juan Felipe
AU - Morillo-Torres, Daniel
AU - Gatica, Gustavo
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025
Y1 - 2025
N2 - In the United States, renal complications rank eighth as the most common cause of death, creating waiting lists approaching 100000 people, with only around 25000 accessing kidney transplants. Faced with the challenge of meeting the total demand for necessary kidneys, renal exchange programs involving donors, recipients, and altruists have emerged, aiming to establish exchanges with chains or shortened cycles for logistical reasons. With the increasing prevalence of these exchanges and programs in both the United States and Europe, this paper presents a genetic algorithm designed to address them. This strategy is conceived to tackle larger instances, overcoming the limitations of conventional mathematical models reported in the literature. The application of this metaheuristic provides an effective and scalable solution, improving kidney allocation in the context of high demand and logistical constraints, offering responses to instances that cannot be addressed exactly.
AB - In the United States, renal complications rank eighth as the most common cause of death, creating waiting lists approaching 100000 people, with only around 25000 accessing kidney transplants. Faced with the challenge of meeting the total demand for necessary kidneys, renal exchange programs involving donors, recipients, and altruists have emerged, aiming to establish exchanges with chains or shortened cycles for logistical reasons. With the increasing prevalence of these exchanges and programs in both the United States and Europe, this paper presents a genetic algorithm designed to address them. This strategy is conceived to tackle larger instances, overcoming the limitations of conventional mathematical models reported in the literature. The application of this metaheuristic provides an effective and scalable solution, improving kidney allocation in the context of high demand and logistical constraints, offering responses to instances that cannot be addressed exactly.
KW - Chains and cycles
KW - Donors and Altruists
KW - Genetic Algorithm
KW - Kidney Exchange Problem
KW - Metaheuristic
UR - http://www.scopus.com/inward/record.url?scp=105001343238&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-83207-9_10
DO - 10.1007/978-3-031-83207-9_10
M3 - Conference contribution
AN - SCOPUS:105001343238
SN - 9783031832062
T3 - Communications in Computer and Information Science
SP - 130
EP - 145
BT - Advanced Research in Technologies, Information, Innovation and Sustainability - 4th International Conference, ARTIIS 2024, Revised Selected Papers
A2 - Guarda, Teresa
A2 - Portela, Filipe
A2 - Gatica, Gustavo
PB - Springer Science and Business Media Deutschland GmbH
T2 - 4th International Conference on Advanced Research in Technologies, Information, Innovation and Sustainability 2024, ARTIIS 2024
Y2 - 21 October 2024 through 23 October 2024
ER -