the inventory–routing problem for distribution of red blood cells considering compatibility of blood group and transshipment between hospitals

This paper presents an inventory-routing problem (irp) for red blood cells (rbcs) distribution, in which -to avoid shortage- supplying the demand with compatible blood groups (substitution) and the rbc transshipments between hospitals (transshipment) are considered. the mentioned problem is investigated in four conditions: 1- allowing the transshipment and substitution, 2- allowing the transshipment, but no substitution, 3- allowing the substitution, but no transshipment, and 4- no allowing the transshipment and substitution. since the mentioned problem is np-hard, the adaptive large neighborhood search algorithm (alns) has been used to solve all conditions. the cost in the first condition is the least one because the feasible solution space is the largest. also, the results show that the transshipment has a more active role than the substitution in reducing the shortage. moreover, in the first and third conditions, the o+ blood group is used more than the other blood groups to meet the other compatible blood groups' demands.