{'fraction_non_alphanumeric': 0.013723696248856358, 'fraction_numerical': 0.0, 'mean_word_length': 5.0777777777777775, '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}}
Network flow problems with fuzzy arc lengths

Network flow problems cover a wide range of engineering and management applications. Many streamlined solution methods have been devised for solving different types of the problems. This paper investigates the network flow problems in that the arc lengths of the network are fuzzy numbers. Based on the integer-solution property of the network flow problem, the Yager ranking indices can be calculated for the fuzzy arcs to change the fuzzy formulation of the problem to a crisp formulation. Consequently, the conventional streamlined solution methods can still be applied to find an optimal solution. This optimal solution is proved to be the same as that derived from an exhaustive comparison of all possible solutions. Two examples, one shortest path and one transshipment, discussed in some previous studies illustrate that the method proposed in this paper is able to find the optimal solution. To show that the proposed method is useful in solving real-world problems, the problem of multimedia transmission over the Internet is exemplified.