Publicação
Optimizing kidney exchange programs with budget and time constraints
| Resumo: | End-stage renal disease a ects millions of people worldwide, with transplantation being the best form of treatment available. Most kidneys for transplants are obtained from deceased donors, but due to the increasing number of patients in need of a transplant, this supply has not been enough to meet the demand. This issue forced new transplantation strategies to emerge, namely obtaining kidneys from living donors. However, even when there is a willing living donor, in over 30% of the cases they are incompatible with the intended recipient of the transplant. Kidney Exchange Programs emerged to provide an alternative solution for patients with willing but incompatible donors, where two or more incompatible donor-patient pairs can nd a compatible transplant by swapping donors. A transplantation plan needs to be de ned in a pool of incompatible donor-patient pairs in order to decide which exchanges should take place. However, after the transplantation plan is de ned, more accurate compatibility tests are performed, possibly revealing new incompatibilities and leading to the cancellation of the plan. Furthermore, due to the complex logistics associated with these tests, there is also usually a time and budget limitation. In this dissertation we address the problem of deciding which tests to carry out in a pool of incompatible donor-patient pairs, taking into account probabilities of match failure, as well as budget and time constraints. We study three problems with varying degrees of limitation of resources in the context of Kidney Exchange Programs and present several methods for solving each one, based on Integer Programming. |
|---|---|
| Autores principais: | Romanciuc, Valeria |
| Assunto: | Kidney exchange programs Optimization Integer programming Programas de doação renal cruzada Otimização Programação Inteira Ciências Naturais::Matemáticas |
| Ano: | 2019 |
| País: | Portugal |
| Tipo de documento: | dissertação de mestrado |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | End-stage renal disease a ects millions of people worldwide, with transplantation being the best form of treatment available. Most kidneys for transplants are obtained from deceased donors, but due to the increasing number of patients in need of a transplant, this supply has not been enough to meet the demand. This issue forced new transplantation strategies to emerge, namely obtaining kidneys from living donors. However, even when there is a willing living donor, in over 30% of the cases they are incompatible with the intended recipient of the transplant. Kidney Exchange Programs emerged to provide an alternative solution for patients with willing but incompatible donors, where two or more incompatible donor-patient pairs can nd a compatible transplant by swapping donors. A transplantation plan needs to be de ned in a pool of incompatible donor-patient pairs in order to decide which exchanges should take place. However, after the transplantation plan is de ned, more accurate compatibility tests are performed, possibly revealing new incompatibilities and leading to the cancellation of the plan. Furthermore, due to the complex logistics associated with these tests, there is also usually a time and budget limitation. In this dissertation we address the problem of deciding which tests to carry out in a pool of incompatible donor-patient pairs, taking into account probabilities of match failure, as well as budget and time constraints. We study three problems with varying degrees of limitation of resources in the context of Kidney Exchange Programs and present several methods for solving each one, based on Integer Programming. |
|---|