期刊文献+

肾源分配网络的局内交换机制设计 被引量:3

Online Exchange Mechanism of Organ Network
下载PDF
导出
摘要 通过考虑有配型不合适的肾捐赠者的患者,同时为了最大化患者的整体疗效,发掘潜在的肾源数量,提出了一种肾源分配网络的局内交换机制.机制设有2个缓冲池,分别存放普通患者和失去活体捐赠者的患者的信息,而有捐赠者但配型不合适的患者等待进入缓冲池.通过寻找患者与活体捐赠者之间的交换圈实现活体肾源交换;通过寻找涵盖普通患者的交换路径同时结合常规肾源,实施分配.在法律允许的情况下,该机制能够通过提升患者的优先等级继续发掘潜在的肾资源.竞争分析结果显示,分配交换机制的竞争比的数学期望受配型概率分布的影响,并依概率收敛,患者的总误配数期望收敛于最优值数学期望的3.13倍,机制的改进比仿真平均值为2.80,平均白细胞抗原错配位点下降35.6%. An online exchange mechanism is proposed based on the kidney assignment network to maximize both the post-operation benefits of patients and the number of potential kidney resources when some patients have living donors who are not suitable in clinical experiments. Two buffers are built up to sort the information of common patients and those who loss living donors, separately. The pairs of patients and their un-suitable donors are waiting to enter the buffers. The exchange circles are checked firstly to implement exchanges among patients and living donors. Then the exchange route covering common patients is considered to make both assignment and exchange, and all patients and traditional kidney resources are taking into account in assignment. The mechanism is able to find out more resources through rising the priority levels of patients under allowance of laws. The result of competitive analysis shows that the mathematical expectation competitive rate is influenced by HLAmm distribution, is p. d. to certain value in theory, and the assignment network can control the expectation of HLAmm sum in 3.13 times of optimal one. The average improvement rate is 2.80, that means, average of HLAmm will decrease 35.6% by using the proposed mechanism.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2010年第4期23-27,共5页 Journal of Xi'an Jiaotong University
基金 国家自然科学基金资助项目(70702030)
关键词 肾移植管理 肾源分配网络 肾源交换 局内交换机制 竞争分析 kidney transplantation management kidney assignment network kidney exchange online exchange mechanism competitive analysis
  • 相关文献

参考文献3

二级参考文献31

共引文献1

同被引文献22

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2朱志军,徐寅峰,徐维军.局内租赁问题的风险补偿模型及其竞争分析[J].管理科学学报,2004,7(3):64-68. 被引量:29
  • 3马卫民,陈国青.价格连续型局内设备赁购问题的竞争分析[J].系统工程理论与实践,2006,26(4):90-96. 被引量:28
  • 4衣方磊,徐寅峰,辛春林.局内动态配送车调度管理及其竞争策略[J].管理科学学报,2007,10(4):1-8. 被引量:9
  • 5Karp R M. On line algoritrhms versus off-line algorithms : How much is it worth to know the future [C]//Proceedings of the IFIP 12^th World Computer Congress on Algorithms, Software, Architecture - Information Processing, 1992,1 ( 1 ) . 416-429.
  • 6Sleator D, Tarjian R E. Amortized efficiency of list update and paging rules [J]. Communication of the ACM, 1985, 28.202-208.
  • 7Koutsoupias E, Papadimitriou C. On the k- server conjecture[J]. Journal of ACM, 1995,42 (5):971- 983.
  • 8Manases M, MeGeoch L A, Sleator D. Competitive strategys for online problems [C]//In Pro. 20th Symp, Theory of Computing,1988:322 -333.
  • 9EI-Yaniv, Karp R M , Nearly optimal replacement policies[J]. Mathematics of Operations Research, 1997, 22(3) :814-839.
  • 10Xu Y F, Xu W J. Competitive algorithms for online leasing problem in probabilistic environments [J]. Lecture Notes in computer Science, 2004:725-730.

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部