{'fraction_non_alphanumeric': 0.014598540145985401, 'fraction_numerical': 0.0, 'mean_word_length': 6.32, '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}}
A New Algorithm for Fully Interval Integer Transportation Problem

Abstract: In this paper, we propose an optimal diagonal algorithm under a generalized interval arithmetic for solving the problem of complete interval integer transport without converting the crisp equivalent problem .The proposed algorithm is simple to implement and it offers a numerical illustration to demonstrate the efficacy of the proposed process. Keywords: Transportation problem, Mathematical formulation using interval integer transportation problem, Numerical, Examples