{'fraction_non_alphanumeric': 0.0273972602739726, 'fraction_numerical': 0.0012453300124533001, 'mean_word_length': 5.28125, '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}}
The study for transportation planning considered the inventory using hybrid genetic algorithm

The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additional constraints or performed in several stages. In this study, we formulate the two-stage transportation planning with inventory and exclusionary side constraints (esc-2ITP). In this model, one week divided into some terms and the annual demands of delivery centers are satisfied for each them and it includes the additional constraint in which the simultaneous shipments between some plants are prohibited. To solve the problem, we propose the hybrid Genetic Algorithms (h-GA) approach by using a priority-based encoding method.