{'fraction_non_alphanumeric': 0.028955532574974147, 'fraction_numerical': 0.0, 'mean_word_length': 5.326797385620915, '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}}
On Capacitated Transportation Problem with Bounds on Rim Conditions

Capacitated Transportation Problem with Bounds on Rim Conditions (CTPBRC) is an extension of classical transportation problem in which route’s transportation capacity, origin’s supply and destination’s demand have lower bound and upper bound. In this paper, CTPBRC is formulated using an integer linear programming model, and transformed into Minimum Cost Flow (MCF) Problem for solution. Based on MCF algorithm, an algorithm, named CTPBRC-A, is proposed to solve CTPBRC. The theory, on which CTPBRC-A is based, is presented. CTPBRC-A not only can judge whether CTPBRC has a feasible solution or not, and can find its optimal solution while feasible solution exists, but also has good performance in the sense of being implemented on computer, computational time and required memory for computation. Numerical experiments demonstrate that CTPBRC-A is an efficient and robust method to solve CTPBRC.