{'fraction_non_alphanumeric': 0.029329608938547486, 'fraction_numerical': 0.0, 'mean_word_length': 5.764150943396227, '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 mixed-integer programming model for the Production-Inventory-Distribution-Routing Problem

In this paper, an under development mixed-integer programming model is presented and used to solve the Production-Inventory-Distribution-Routing Problem (PIDRP), the main objective is to minimize the total cost of production, inventory, and transportation without violating the demand fulfillment policy. The proposed model deals with multiple products with different characteristics, split deliveries, a heterogeneous fleet of vehicles, and a route limitation for each vehicle. The main contribution of this work is the validation of the mathematical model and testing it for solving small-sized instances from literature.