The New UK National Kidney Allocation Scheme With Maximized “R4-D4” Kidney Transplants: Better Patient-to-Graft Longevity Matching May Be at the Cost of More Resources

The distributed material warehouse is the crucial link in the process of modern enterprise construction, and the goal of the enterprise is to save the cost of material distribution and reduce the time of distribution. In order to obtain the optimal ordering and allocation scheme, firstly, a distributed inventory system consisting of an ordering centre, a material coordination centre and n material warehouses are considered, and the cost model of ordering and allocation of the distributed material warehouse is established. Next, the safety stock and the ordering point of the distributed material warehouse are solved. Then the improved genetic algorithm-simulated annealing algorithm (IGA-SA) is used to solve the optimization of the distributed material warehouse. Finally, the application example is given. The results show that the IGA-SA algorithm can effectively reduce inventory cost and improve inventory utilization.

Download Full-text

IMPACT OF EXPLANT BIOPSY ASSESSMENTS AND KIDNEY ALLOCATION ON OUTCOMES OF EXPANDED CRITERIA DONOR KIDNEY TRANSPLANTS VERSUS STANDARD CRITERIA DONOR KIDNEY TRANSPLANTS IN AN ASIAN TRANSPLANT PROGRAM

Transplantation Journal ◽

10.1097/01.tp.0000698560.44699.f9 ◽

2020 ◽

Vol 104 (S3) ◽

pp. S62-S62

Author(s):

Yap Yun Ting ◽

Ng Chee Yong ◽

Chionh Chang Yin ◽

Terence Kee Yi Shern

Keyword(s):

Kidney Transplants ◽

Donor Kidney ◽

Kidney Allocation ◽

Transplant Program ◽

Expanded Criteria Donor ◽

Expanded Criteria

Download Full-text

A single centre’s experience of the revised DCD kidney allocation scheme.

10.26226/morressier.58736690d462b80292384167 ◽

2017 ◽

Author(s):

Andy Connor

Keyword(s):

Allocation Scheme ◽

Kidney Allocation

Download Full-text

A New UK 2006 National Kidney Allocation Scheme for Deceased Heart-Beating Donor Kidneys

Transplantation Journal ◽

10.1097/tp.0b013e3181c9029d ◽

2010 ◽

Vol 89 (4) ◽

pp. 387-394 ◽

Cited By ~ 68

Author(s):

Rachel J. Johnson ◽

Susan V. Fuggle ◽

Lisa Mumford ◽

J. Andrew Bradley ◽

John L. R. Forsythe ◽

...

Keyword(s):

Allocation Scheme ◽

Kidney Allocation ◽

Heart Beating

Download Full-text

Stackelberg Game-Based Power Allocation for V2X Communications

Sensors ◽

10.3390/s20010058 ◽

2019 ◽

Vol 20 (1) ◽

pp. 58

Author(s):

Erqing Zhang ◽

Sixing Yin ◽

Huisheng Ma

Keyword(s):

Power Consumption ◽

Power Allocation ◽

Cellular Networks ◽

Stackelberg Game ◽

Base Station ◽

Allocation Scheme ◽

Economic Profit ◽

Simulation Results ◽

The Cost ◽

Macro Cellular

Ultra-reliable low-latency communication (URLLC) is one of the three usage scenarios anticipated for 5G, which plays an important role in advanced applications of vehicle-to-everything (V2X) communications. In this paper, the Stackelberg game-based power allocation problem was investigated in V2X communications underlaying cellular networks. Assuming that the macro-cellular base station (MBS) sets the interference prices to protect itself from the V2X users (VUEs), the Stackelberg game was adopted to analyze the interaction between MBS and VUEs, where the former acts as a leader and the latter act as followers. For MBS, we aimed at maximizing its utility from interference revenue while considering the cost of interference. Meanwhile, the VUEs aimed at maximizing their utilities per unit power consumption. We analyzed the Stackelberg model and obtained the optimal prices for MBS and optimal transmit powers for VUEs. Simulation results demonstrated the superiority of the proposed Stackelberg game-based power allocation scheme in comparison with the traditional power allocation strategy. Meanwhile, the proposed scheme achieved a better trade-off between economic profit and power consumption.

Download Full-text

Comparison of Methods for Allocating Costs of Empty Railcar Movements in a Railcar Pooling System

Transportation Research Record Journal of the Transportation Research Board ◽

10.1177/0361198105191600112 ◽

2005 ◽

Vol 1916 (1) ◽

pp. 88-95

Author(s):

Yao Cheng ◽

Wei-Hua Lin

Keyword(s):

Game Theory ◽

Computational Efficiency ◽

Cost Allocation ◽

Comparison Of Methods ◽

Allocation Scheme ◽

Before And After ◽

The Cost

Allocating the cost of empty railcar miles to partners in a railcar pooling system is an important pricing problem in railway management. Recently, the authors of this paper proposed a cost allocation scheme for empty railcar movements based on game theory that explicitly considers the level of participation and contribution from each partner, the costs generated before and after cooperation, and the overall benefit obtained by each partner because of cooperation. This paper compares the performance of the model with three other cost allocation models with respect to fairness, stability, and computational efficiency. The comparison is made with two scenarios adapted from examples documented in the literature. The results indicate that the cost allocation scheme based on game theory outperforms other methods in ensuring fairness and enhancing stability in a coalition. Most remarkably, it yields reasonable results even in situations in which other models behave poorly. Computationally, it is manageable for practical problems.

Download Full-text