{'fraction_non_alphanumeric': 0.011093502377179081, 'fraction_numerical': 0.0, 'mean_word_length': 5.448979591836735, '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}}
Study on Capacity Expansion Model and Arithmetic of Transportation Network with Distribution Centers

We consider a type of transportation problem with distribution centers. Solving this question by using auxiliary network: every distribution center in the transportation network is split into two nodes which are linked to form new arcs in the new network, enduing every arc with parameter vector, and turning this transportation problem into minimum cost flow problem. Basing on this point, the capacity expansion problem of the distribution centers and the paths in the transportation network are also considered in the article.