{'fraction_non_alphanumeric': 0.018257261410788383, 'fraction_numerical': 0.0, 'mean_word_length': 5.060301507537688, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimizing the supply chain design for organ transplants

Organ transplants have always suffered from long waiting lists. This has led to time playing a crucial role in the organ transplant process. Therefore, from the moment a potential donor is notified, it is important to get the organ as quickly as possible to its recipient. The ultimate goal of this paper is to develop a general model in order to minimize this transport time. This is accomplished by jointly determining which transplant center(s) for which organ(s) to establish in a particular country (given the location of potential transplant centers), and the location of shipping agents for transportation of these organs. The problem is modeled as a mixed integer programming (MIP) problem. We then apply this model to organ transplants in Belgium. Extensive numerical experiments show that considering only the components influencing the cold ischemia time in the objective function, as well as a budget constraint or non binding time covering constraint, leads to the centralization of transplant centers. The MIP model performs well in terms of computation times except for the case involving a huge number of potential shipping agents.