arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.04918cs.GT
收藏

求解稳定换肾问题的新的可拓规划模型

Novel Integer Programming models for the stable kidney exchange problem

Xenia Klimentova, Péter Biró, Ana Viana, Virginia Costa, João Pedro Pedroso

摘要:

肾脏交换计划(KEP)为患有终末期肾病的患者提供了额外的移植可能性。如果一个病人有一个愿意的活体捐赠者,但病人与捐赠者不相容,这对病人-捐赠者可以加入一个不相容的配对库,如果病人和捐赠者之间存在两对或更多对的相容性,他们之间可以交换器官。这个问题可以建模为一个整数规划,在一般情况下,目的是找到应该被选择用于移植的对,使得执行最大数量的移植。在本文中,我们认为,对于每个病人可能存在一个优先顺序的器官,他/她可以接收,因为一个病人可能是兼容的几个捐助者,但可能有一个更好的适合一些比其他人。在这种设置下,目标是找到最大基数稳定交换,一个不存在阻塞循环的解决方案。为此,我们提出了三个新的整数规划模型的基础上著名的边缘和周期配方。这些公式进行了调整,以寻找稳定和强稳定的交换条件下严格的偏好和偏好的关系时,可能存在的情况下。此外,我们研究的情况下,稳定性的要求可以放宽解决方案中允许的最大基数与阻塞周期数之间的权衡。所提出的模型的有效性进行了评估,通过广泛的计算实验上的广泛的实例。

英文摘要:

Kidney exchange programs (KEP's) represent an additional possibility of transplant for patients suffering from end stage kidney disease. If a patient has a willing living donor with whom the patient is not compatible, the pair patient--donor can join a pool of incompatible pairs and, if compatibility between patient and donor in two our more pairs exists, organs can be exchanged between them. The problem can be modeled as an integer program that, in general, aims at finding the pairs that should be selected for transplant such that maximum number of transplants is performed. In this paper we consider that for each patient there may exist a preference order over the organs that he/she can receive, since a patient may be compatible with several donors but may have a better fit over some than over others. Under this setting, the aim is to find the maximum cardinality stable exchange, a solution where no blocking cycle exists. For this purpose we propose three novel integer programming models based on the well-known edge and cycle formulations. These formulations are adjusted for both finding stable and strongly stable exchanges under strict preferences and for the case when ties in preferences may exist. Furthermore, we study a situation when the stability requirement can be relaxed by addressing the trade-off between maximum cardinality versus number of blocking cycles allowed in a solution. The effectiveness of the proposed models is assessed through extensive computational experiments on a wide set of instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑