{'fraction_non_alphanumeric': 0.01639344262295082, 'fraction_numerical': 0.0, 'mean_word_length': 5.1891891891891895, '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}}
INVENTORY ALLOCATION IN MULTI-PERIOD MULTI-ECHELON LOGISTICS NETWORKS OF MODULAR PRODUCTS

In this study, inventory planning in logistics networks of modular products is investigated in a multi-period and multi-echelon setting. It is shown that this optimization problem can be converted to another problem which is briefly called modular proportional flow problem. This later problem is a minimum cost network flow problem with side constraints. The whole network consists of several disjoint subnetworks requiring the flows in some given sets of arcs to be proportional. Building efficient solution methods to this problem is important since it can be addressed several times as a subproblem. First, we show that the bases of this problem are good forests, and then design a network simplex algorithm that exploits this special structure. Finally, an illustrative example is supplied to demonstrate the algorithm.